Securely Storing Secure Packages in a Storage Network

ABSTRACT

A method for execution by a computing device of a storage network includes appending at least a decode threshold number of encoded key slices of a set of encoded key slices to at least some encrypted data segments of a plurality of encrypted data segments to produce secure packages. The method further includes error encoding, in accordance with error encoding parameters, the secure packages to produce sets of encoded data slices, where a first secure package of the secure packages is dispersed storage error encoded using an error encoding function of the error encoding parameters to produce a first set of encoded data slices of the sets of encoded data slices. The method further includes outputting the sets of encoded data slices for storage in memory of the storage network.

CROSS-REFERENCE TO RELATED PATENTS

This application claims priority pursuant to 35 U.S.C. § 120 as acontinuation of U.S. Utility Application No. 17/197,807, entitled“DECRYPTING SECURE PACKAGES IN A STORAGE NETWORK,” filed Mar. 10, 2021,allowed, which is a continuation of U.S. Utility Application No.16/040,786, entitled “SECURELY STORING RANDOM KEYS IN A DISPERSEDSTORAGE NETWORK,” filed Jul. 20, 2018, issued as U.S. Pat. No.10,977,194 on Apr. 13, 2021, which is a continuation-in-part of U.S.Utility Application No. 15/799,943 entitled “SECURELY DISTRIBUTINGRANDOM KEYS IN A DISPERSED STORAGE NETWORK,” filed Oct. 31, 2017, issuedas U.S. Pat. No. 10,055,283 on Aug. 21, 2018, which claims prioritypursuant to 35 U.S.C. § 120 as a continuation-in-part of U.S. UtilityApplication No. 15/345,262 entitled “ENCRYPTING DATA FOR STORAGE IN ADISPERSED STORAGE NETWORK,” filed Nov. 07, 2016, issued as U.S. Pat. No.9,842,063 on Dec. 12, 2017, which claims priority pursuant to 35 U.S.C.§ 120 as a continuation of U.S. Utility Application No. 14/499,570,entitled “ENCRYPTING DATA FOR STORAGE IN A DISPERSED STORAGE NETWORK,”filed Sep. 29, 2014, issued as U.S. Pat. No. 9,495,240 on Nov. 15, 2016,which claims priority pursuant to 35 U.S.C. § 120 as a continuation ofU.S. Utility Application No. 13/686,827, entitled “ENCRYPTING DATA FORSTORAGE IN A DISPERSED STORAGE NETWORK,” filed Nov. 27, 2012, issued asU.S. Pat. No. 8,848,906 on Sep. 30, 2014, which claims priority pursuantto 35 U.S.C. § 119(e) to U.S. Provisional Application No. 61/564,200,entitled “DISPERSED STORAGE NETWORK STORAGE MODULE,” filed Nov. 28,2011, expired, all of which are hereby incorporated herein by referencein their entirety and made part of the present U.S. Utility PatentApplication for all purposes.

STATEMENT REGARDING FEDERALLY SPONSORED RESEARCH OR DEVELOPMENT

Not Applicable.

INCORPORATION-BY-REFERENCE OF MATERIAL SUBMITTED ON A COMPACT DISC

Not Applicable.

BACKGROUND OF THE INVENTION Technical Field of the Invention

This invention relates generally to computing systems and moreparticularly to data storage solutions within such computing systems.

Description of Related Art

Computers are known to communicate, process, and store data. Suchcomputers range from wireless smart phones to data centers that supportmillions of web searches, stock trades, or on-line purchases every day.In general, a computing system generates data and/or manipulates datafrom one form into another. For instance, an image sensor of thecomputing system generates raw picture data and, using an imagecompression program (e.g., JPEG, MPEG, etc.), the computing systemmanipulates the raw picture data into a standardized compressed image.

With continued advances in processing speed and communication speed,computers are capable of processing real time multimedia data forapplications ranging from simple voice communications to streaming highdefinition video. As such, general-purpose information appliances arereplacing purpose-built communications devices (e.g., a telephone). Forexample, smart phones can support telephony communications but they arealso capable of text messaging and accessing the internet to performfunctions including email, web browsing, remote applications access, andmedia communications (e.g., telephony voice, image transfer, musicfiles, video files, real time video streaming. etc.).

Each type of computer is constructed and operates in accordance with oneor more communication, processing, and storage standards. As a result ofstandardization and with advances in technology, more and moreinformation content is being converted into digital formats. Forexample, more digital cameras are now being sold than film cameras, thusproducing more digital pictures. As another example, web-basedprogramming is becoming an alternative to over the air televisionbroadcasts and/or cable broadcasts. As further examples, papers, books,video entertainment, home video, etc. are now being stored digitally,which increases the demand on the storage function of computers.

A typical computer storage system includes one or more memory devicesaligned with the needs of the various operational aspects of thecomputer’s processing and communication functions. Generally, theimmediacy of access dictates what type of memory device is used. Forexample, random access memory (RAM) memory can be accessed in any randomorder with a constant response time, thus it is typically used for cachememory and main memory. By contrast, memory device technologies thatrequire physical movement such as magnetic disks, tapes, and opticaldiscs, have a variable response time as the physical movement can takelonger than the data transfer, thus they are typically used forsecondary memory (e.g., hard drive, backup memory, etc.).

A computer’s storage system will be compliant with one or more computerstorage standards that include, but are not limited to, network filesystem (NFS), flash file system (FFS), disk file system (DFS), smallcomputer system interface (SCSI), internet small computer systeminterface (iSCSI), file transfer protocol (FTP), and web-baseddistributed authoring and versioning (WebDAV). These standards specifythe data storage format (e.g., files, data objects, data blocks,directories, etc.) and interfacing between the computer’s processingfunction and its storage system, which is a primary function of thecomputer’s memory controller.

Despite the standardization of the computer and its storage system,memory devices fail; especially commercial grade memory devices thatutilize technologies incorporating physical movement (e.g., a discdrive). For example, it is fairly common for a disc drive to routinelysuffer from bit level corruption and to completely fail after threeyears of use. One solution is to utilize a higher-grade disc drive,which adds significant cost to a computer.

Another solution is to utilize multiple levels of redundant disc drivesto replicate the data into two or more copies. One such redundant driveapproach is called redundant array of independent discs (RAID). In aRAID device, a RAID controller adds parity data to the original databefore storing it across the array. The parity data is calculated fromthe original data such that the failure of a disc will not result in theloss of the original data. For example, RAID 5 uses three discs toprotect data from the failure of a single disc. The parity data, andassociated redundancy overhead data, reduces the storage capacity ofthree independent discs by one third (e.g., n-1 = capacity). RAID 6 canrecover from a loss of two discs and requires a minimum of four discswith a storage capacity of n-2.

While RAID addresses the memory device failure issue, it is not withoutits own failure issues that affect its effectiveness, efficiency andsecurity. For instance, as more discs are added to the array, theprobability of a disc failure increases, which increases the demand formaintenance. For example, when a disc fails, it needs to be manuallyreplaced before another disc fails and the data stored in the RAIDdevice is lost. To reduce the risk of data loss, data on a RAID deviceis typically copied on to one or more other RAID devices. While thisaddresses the loss of data issue, it raises a security issue sincemultiple copies of data are available, which increases the chances ofunauthorized access. Further, as the amount of data being stored grows,the overhead of RAID devices becomes a non-trivial efficiency issue.

BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWING(S)

FIG. 1 is a schematic block diagram of an embodiment of a computingsystem in accordance with the invention;

FIG. 2 is a schematic block diagram of an embodiment of a computing corein accordance with the invention;

FIG. 3 is a schematic block diagram of an embodiment of a distributedstorage processing unit in accordance with the invention;

FIG. 4 is a schematic block diagram of an embodiment of a grid module inaccordance with the invention;

FIG. 5 is a diagram of an example embodiment of error coded data slicecreation in accordance with the invention;

FIG. 6A is a schematic block diagram of an embodiment of a storagemodule in accordance with the invention;

FIG. 6B is a schematic block diagram of another embodiment of a storagemodule in accordance with the invention;

FIG. 6C is a flowchart illustrating an example of storing data inaccordance with the invention;

FIG. 6D is a schematic block diagram of another embodiment of a storagemodule in accordance with the invention;

FIG. 6E is a flowchart illustrating an example of retrieving stored datain accordance with the invention;

FIG. 7A is a schematic block diagram of another embodiment of a storagemodule in accordance with the invention;

FIG. 7B is a flowchart illustrating another example of encoding data inaccordance with the invention;

FIG. 7C is a flowchart illustrating another example of decoding data inaccordance with the invention;

FIG. 8A is a schematic block diagram of another embodiment of a storagemodule in accordance with the invention;

FIG. 8B is a flowchart illustrating another example of encoding data inaccordance with the invention;

FIG. 8C is a flowchart illustrating another example of decoding data inaccordance with the invention;

FIG. 9A is a schematic block diagram of another embodiment of a storagemodule in accordance with the invention;

FIG. 9B is a flowchart illustrating another example of encoding data inaccordance with the invention; and

FIG. 9C is a flowchart illustrating another example of decoding data inaccordance with the invention;

FIG. 10 is a schematic block diagram of a computing device of thedispersed storage network (DSN) in accordance with the invention;

FIGS. 11A-11B are schematic block diagrams of examples of securepackages in accordance with the invention;

FIG. 12 is a schematic block diagram of a computing device of thedispersed storage network (DSN) in accordance with the invention;

FIG. 13 is a schematic block diagram of a computing device of thedispersed storage network (DSN) in accordance with the invention;

FIG. 14 is a schematic block diagram of an example of secure packages inaccordance with the invention; and

FIG. 15 is a logic flowchart illustrating an example of securely storingrandom keys in accordance with the invention.

DETAILED DESCRIPTION OF THE INVENTION

FIG. 1 is a schematic block diagram of a computing system 10 (e.g., adispersed or distributed storage network (DSN)) that includes one ormore of a first type of user devices 12, one or more of a second type ofuser devices 14, at least one distributed storage (DS) processing unit16, at least one DS managing unit 18, at least one storage integrityprocessing unit 20, and a distributed storage network (DSN) memory 22coupled via a network 24. The network 24 may include one or morewireless and/or wire lined communication systems; one or more privateintranet systems and/or public internet systems; and/or one or morelocal area networks (LAN) and/or wide area networks (WAN).

The DSN memory 22 includes a plurality of distributed storage (DS) units36 for storing data of the system. Each of the DS units 36 includes aprocessing module and memory and may be located at a geographicallydifferent site than the other DS units (e.g., one in Chicago, one inMilwaukee, etc.).

Each of the user devices 12 - 14, the DS processing unit 16, the DSmanaging unit 18, and the storage integrity processing unit 20 may be aportable computing device (e.g., a social networking device, a gamingdevice, a cell phone, a smart phone, a personal digital assistant, adigital music player, a digital video player, a laptop computer, ahandheld computer, a video game controller, and/or any other portabledevice that includes a computing core) and/or a fixed computing device(e.g., a personal computer, a computer server, a cable set-top box, asatellite receiver, a television set, a printer, a fax machine, homeentertainment equipment, a video game console, and/or any type of homeor office computing equipment). Such a portable or fixed computingdevice includes a computing core 26 and one or more interfaces 30, 32,and/or 33. An embodiment of the computing core 26 will be described withreference to FIG. 2 .

With respect to the interfaces, each of the interfaces 30, 32, and 33includes software and/or hardware to support one or more communicationlinks via the network 24 indirectly and/or directly. For example,interface 30 supports a communication link (wired, wireless, direct, viaa LAN, via the network 24, etc.) between the first type of user device14 and the DS processing unit 16. As another example, DSN interface 32supports a plurality of communication links via the network 24 betweenthe DSN memory 22 and the DS processing unit 16, the first type of userdevice 12, and/or the storage integrity processing unit 20. As yetanother example, interface 33 supports a communication link between theDS managing unit 18 and any one of the other devices and/or units 12,14, 16, 20, and/or 22 via the network 24.

In general and with respect to data storage, the system 10 supportsthree primary functions: distributed network data storage management,distributed data storage and retrieval, and data storage integrityverification. In accordance with these three primary functions, data canbe distributedly stored in a plurality of physically different locationsand subsequently retrieved in a reliable and secure manner regardless offailures of individual storage devices, failures of network equipment,the duration of storage, the amount of data being stored, attempts athacking the data, etc.

The DS managing unit 18 performs distributed network data storagemanagement functions, which include establishing distributed datastorage parameters, performing network operations, performing networkadministration, and/or performing network maintenance. The DS managingunit 18 establishes the distributed data storage parameters (e.g.,allocation of virtual DSN memory space, distributed storage parameters,security parameters, billing information, user profile information,etc.) for one or more of the user devices 12-14 (e.g., established forindividual devices, established for a user group of devices, establishedfor public access by the user devices, etc.). For example, the DSmanaging unit 18 coordinates the creation of a vault (e.g., a virtualmemory block) within the DSN memory 22 for a user device (for a group ofdevices, or for public access). The DS managing unit 18 also determinesthe distributed data storage parameters for the vault. In particular,the DS managing unit 18 determines a number of slices (e.g., the numberthat a data segment of a data file and/or data block is partitioned intofor distributed storage) and a read threshold value (e.g., the minimumnumber of slices required to reconstruct the data segment).

As another example, the DS managing unit 18 creates and stores, locallyor within the DSN memory 22, user profile information. The user profileinformation includes one or more of authentication information,permissions, and/or the security parameters. The security parameters mayinclude one or more of encryption/decryption scheme, one or moreencryption keys, key generation scheme, and data encoding/decodingscheme.

As yet another example, the DS managing unit 18 creates billinginformation for a particular user, user group, vault access, publicvault access, etc. For instance, the DS managing unit 18 tracks thenumber of times a user accesses a private vault and/or public vaults,which can be used to generate a per-access bill. In another instance,the DS managing unit 18 tracks the amount of data stored and/orretrieved by a user device and/or a user group, which can be used togenerate a per-data-amount bill.

The DS managing unit 18 also performs network operations, networkadministration, and/or network maintenance. As at least part ofperforming the network operations and/or administration, the DS managingunit 18 monitors performance of the devices and/or units of the system10 for potential failures, determines the devices’ and/or units’activation status, determines the devices’ and/or units’ loading, andany other system level operation that affects the performance level ofthe system 10. For example, the DS managing unit 18 receives andaggregates network management alarms, alerts, errors, statusinformation, performance information, and messages from the devices12-14 and/or the units 16, 20, 22. For example, the DS managing unit 18receives a simple network management protocol (SNMP) message regardingthe status of the DS processing unit 16.

The DS managing unit 18 performs the network maintenance by identifyingequipment within the system 10 that needs replacing, upgrading,repairing, and/or expanding. For example, the DS managing unit 18determines that the DSN memory 22 needs more DS units 36 or that one ormore of the DS units 36 needs updating.

The second primary function (i.e., distributed data storage andretrieval) begins and ends with a user device 12 - 14. For instance, ifa second type of user device 14 has a data file 38 and/or data block 40to store in the DSN memory 22, it sends the data file 38 and/or datablock 40 to the DS processing unit 16 via its interface 30. As will bedescribed in greater detail with reference to FIG. 2 , the interface 30functions to mimic a conventional operating system (OS) file systeminterface (e.g., network file system (NFS), flash file system (FFS),disk file system (DFS), file transfer protocol (FTP), web-baseddistributed authoring and versioning (WebDAV), etc.) and/or a blockmemory interface (e.g., small computer system interface (SCSI), internetsmall computer system interface (iSCSI), etc.). In addition, theinterface 30 may attach a user identification code (ID) to the data file38 and/or data block 40.

The DS processing unit 16 receives the data file 38 and/or data block 40via its interface 30 and performs a distributed storage (DS) process 34thereon (e.g., an error coding dispersal storage function). The DSprocessing 34 begins by partitioning the data file 38 and/or data block40 into one or more data segments, which is represented as Y datasegments. For example, the DS processing 34 may partition the data file38 and/or data block 40 into a fixed byte size segment (e.g., 2¹ to2^(n) bytes, where n =>2) or a variable byte size (e.g., change bytesize from segment to segment, or from groups of segments to groups ofsegments, etc.).

For each of the Y data segments, the DS processing 34 error encodes(e.g., forward error correction (FEC), information dispersal algorithm,or error correction coding) and slices (or slices then error encodes)the data segment into a plurality of error coded (EC) data slices 42 -48, which is represented as X slices per data segment. The number ofslices (X) per segment, which corresponds to a number of pillars n, isset in accordance with the distributed data storage parameters and theerror coding scheme. For example, if a Reed-Solomon (or other FECscheme) is used in an n/k system, then a data segment is divided into nslices, where k number of slices is needed to reconstruct the originaldata (i.e., k is the threshold). As a few specific examples, the n/kfactor may be 5/3; 6/4; 8/6; 8/5; 16/10.

For each EC slice 42 - 48, the DS processing unit 16 creates a uniqueslice name and appends it to the corresponding EC slice 42 - 48. Theslice name includes universal DSN memory addressing routing information(e.g., virtual memory addresses in the DSN memory 22) and user-specificinformation (e.g., user ID, file name, data block identifier, etc.).

The DS processing unit 16 transmits the plurality of EC slices 42 - 48to a plurality of DS units 36 of the DSN memory 22 via the DSN interface32 and the network 24. The DSN interface 32 formats each of the slicesfor transmission via the network 24. For example, the DSN interface 32may utilize an internet protocol (e.g., TCP/IP, etc.) to packetize theEC slices 42 - 48 for transmission via the network 24.

The number of DS units 36 receiving the EC slices 42 - 48 is dependenton the distributed data storage parameters established by the DSmanaging unit 18. For example, the DS managing unit 18 may indicate thateach slice is to be stored in a different DS unit 36. As anotherexample, the DS managing unit 18 may indicate that like slice numbers ofdifferent data segments are to be stored in the same DS unit 36. Forexample, the first slice of each of the data segments is to be stored ina first DS unit 36, the second slice of each of the data segments is tobe stored in a second DS unit 36, etc. In this manner, the data isencoded and distributedly stored at physically diverse locations toimprove data storage integrity and security.

Each DS unit 36 that receives an EC slice 42 - 48 for storage translatesthe virtual DSN memory address of the slice into a local physicaladdress for storage. Accordingly, each DS unit 36 maintains a virtual tophysical memory mapping to assist in the storage and retrieval of data.

The first type of user device 12 performs a similar function to storedata in the DSN memory 22 with the exception that it includes the DSprocessing. As such, the device 12 encodes and slices the data fileand/or data block it has to store. The device then transmits the slices11 to the DSN memory via its DSN interface 32 and the network 24.

For a second type of user device 14 to retrieve a data file or datablock from memory, it issues a read command via its interface 30 to theDS processing unit 16. The DS processing unit 16 performs the DSprocessing 34 to identify the DS units 36 storing the slices of the datafile and/or data block based on the read command. The DS processing unit16 may also communicate with the DS managing unit 18 to verify that theuser device 14 is authorized to access the requested data.

Assuming that the user device is authorized to access the requesteddata, the DS processing unit 16 issues slice read commands to at least athreshold number of the DS units 36 storing the requested data (e.g., toat least 10 DS units for a 16/10 error coding scheme). Each of the DSunits 36 receiving the slice read command, verifies the command,accesses its virtual to physical memory mapping, retrieves the requestedslice, or slices, and transmits it to the DS processing unit 16.

Once the DS processing unit 16 has received a read threshold number ofslices for a data segment, it performs an error decoding function andde-slicing to reconstruct the data segment. When Y number of datasegments has been reconstructed, the DS processing unit 16 provides thedata file 38 and/or data block 40 to the user device 14. Note that thefirst type of user device 12 performs a similar process to retrieve adata file and/or data block.

The storage integrity processing unit 20 performs the third primaryfunction of data storage integrity verification. In general, the storageintegrity processing unit 20 periodically retrieves slices 45, and/orslice names, of a data file or data block of a user device to verifythat one or more slices have not been corrupted or lost (e.g., the DSunit failed). The retrieval process mimics the read process previouslydescribed.

If the storage integrity processing unit 20 determines that one or moreslices is corrupted or lost, it rebuilds the corrupted or lost slice(s)in accordance with the error coding scheme. The storage integrityprocessing unit 20 stores the rebuilt slice, or slices, in theappropriate DS unit(s) 36 in a manner that mimics the write processpreviously described.

FIG. 2 is a schematic block diagram of an embodiment of a computing core26 that includes a processing module 50, a memory controller 52, mainmemory 54, a video graphics processing unit 55, an input/output (IO)controller 56, a peripheral component interconnect (PCI) interface 58,an IO interface 60, at least one IO device interface module 62, a readonly memory (ROM) basic input output system (BIOS) 64, and one or morememory interface modules. The memory interface module(s) includes one ormore of a universal serial bus (USB) interface module 66, a host busadapter (HBA) interface module 68, a network interface module 70, aflash interface module 72, a hard drive interface module 74, and a DSNinterface module 76. Note the DSN interface module 76 and/or the networkinterface module 70 may function as the interface 30 of the user device14 of FIG. 1 . Further note that the IO device interface module 62and/or the memory interface modules may be collectively or individuallyreferred to as IO ports.

FIG. 3 is a schematic block diagram of an embodiment of a dispersedstorage (DS) processing module 34 of user device 12 and/or of the DSprocessing unit 16. The DS processing module 34 includes a gatewaymodule 78, an access module 80, a grid module 82, and a storage module84. The DS processing module 34 may also include an interface 30 and theDSnet interface 32 or the interfaces 68 and/or 70 may be part of userdevice 12 or of the DS processing unit 16. The DS processing module 34may further include a bypass/feedback path between the storage module 84to the gateway module 78. Note that the modules 78-84 of the DSprocessing module 34 may be in a single unit or distributed acrossmultiple units.

In an example of storing data, the gateway module 78 receives anincoming data object that includes a user ID field 86, an object namefield 88, and the data object field 40 and may also receivecorresponding information that includes a process identifier (e.g., aninternal process/application ID), metadata, a file system directory, ablock number, a transaction message, a user device identity (ID), a dataobject identifier, a source name, and/or user information. The gatewaymodule 78 authenticates the user associated with the data object byverifying the user ID 86 with the DS managing unit 18 and/or anotherauthenticating unit.

When the user is authenticated, the gateway module 78 obtains userinformation from the management unit 18, the user device, and/or theother authenticating unit. The user information includes a vaultidentifier, operational parameters, and user attributes (e.g., userdata, billing information, etc.). A vault identifier identifies a vault,which is a virtual memory space that maps to a set of DS storage units36. For example, vault 1 (i.e., user 1′s DSN memory space) includeseight DS storage units (X=8 wide) and vault 2 (i.e., user 2′s DSN memoryspace) includes sixteen DS storage units (X=16 wide). The operationalparameters may include an error coding algorithm, the width n (number ofpillars X or slices per segment for this vault), a read threshold T, awrite threshold, an encryption algorithm, a slicing parameter, acompression algorithm, an integrity check method, caching settings,parallelism settings, and/or other parameters that may be used to accessthe DSN memory layer.

The gateway module 78 uses the user information to assign a source name35 to the data. For instance, the gateway module 78 determines thesource name 35 of the data object 40 based on the vault identifier andthe data object. For example, the source name may contain a fileidentifier (ID), a vault generation number, a reserved field, and avault identifier (ID). As another example, the gateway module 78 maygenerate the file ID based on a hash function of the data object 40.Note that the gateway module 78 may also perform message conversion,protocol conversion, electrical conversion, optical conversion, accesscontrol, user identification, user information retrieval, trafficmonitoring, statistics generation, configuration, management, and/orsource name determination.

The access module 80 receives the data object 40 and creates a series ofdata segments 1 through Y 90-92 in accordance with a data storageprotocol (e.g., file storage system, a block storage system, and/or anaggregated block storage system). The number of segments Y may be chosenor randomly assigned based on a selected segment size and the size ofthe data object. For example, if the number of segments is chosen to bea fixed number, then the size of the segments varies as a function ofthe size of the data object. For instance, if the data object is animage file of 4,194,304 eight bit bytes (e.g., 33,554,432 bits) and thenumber of segments Y = 131,072, then each segment is 256 bits or 32bytes. As another example, if segment size is fixed, then the number ofsegments Y varies based on the size of data object. For instance, if thedata object is an image file of 4,194,304 bytes and the fixed size ofeach segment is 4,096 bytes, then the number of segments Y = 1,024. Notethat each segment is associated with the same source name.

The grid module 82 receives the data segments and may manipulate (e.g.,compression, encryption, cyclic redundancy check (CRC), etc.) each ofthe data segments before performing an error coding function of theerror coding dispersal storage function to produce a pre-manipulateddata segment. After manipulating a data segment, if applicable, the gridmodule 82 error encodes (e.g., Reed-Solomon, Convolution encoding,Trellis encoding, etc.) the data segment or manipulated data segmentinto X error coded data slices 42-44.

The value X, or the number of pillars (e.g., X = 16), is chosen as aparameter of the error coding dispersal storage function. Otherparameters of the error coding dispersal function include a readthreshold T, a write threshold W, etc. The read threshold (e.g., T = 10,when X = 16) corresponds to the minimum number of error-free error codeddata slices required to reconstruct the data segment. In other words,the DS processing module 34 can compensate for X-T (e.g., 16-10 = 6)missing error coded data slices per data segment. The write threshold Wcorresponds to a minimum number of DS storage units that acknowledgeproper storage of their respective data slices before the DS processingmodule indicates proper storage of the encoded data segment. Note thatthe write threshold is greater than or equal to the read threshold for agiven number of pillars (X).

For each data slice of a data segment, the grid module 82 generates aunique slice name 37 and attaches it thereto. The slice name 37 includesa universal routing information field and a vault specific field and maybe 48 bytes (e.g., 24 bytes for each of the universal routinginformation field and the vault specific field). As illustrated, theuniversal routing information field includes a slice index, a vault ID,a vault generation, and a reserved field. The slice index is based onthe pillar number and the vault ID and, as such, is unique for eachpillar (e.g., slices of the same pillar for the same vault for anysegment will share the same slice index). The vault specific fieldincludes a data name, which includes a file ID and a segment number(e.g., a sequential numbering of data segments 1-Y of a simple dataobject or a data block number).

Prior to outputting the error coded data slices of a data segment, thegrid module may perform post-slice manipulation on the slices. Ifenabled, the manipulation includes slice level compression, encryption,CRC, addressing, tagging, and/or other manipulation to improve theeffectiveness of the computing system.

When the error coded data slices of a data segment are ready to beoutputted, the grid module 82 determines which of the DS storage units36 will store the EC data slices based on a dispersed storage memorymapping associated with the user’s vault and/or DS storage unitattributes. The DS storage unit attributes may include availability,self-selection, performance history, link speed, link latency,ownership, available DSN memory, domain, cost, a prioritization scheme,a centralized selection message from another source, a lookup table,data ownership, and/or any other factor to optimize the operation of thecomputing system. Note that the number of DS storage units 36 is equalto or greater than the number of pillars (e.g., X) so that no more thanone error coded data slice of the same data segment is stored on thesame DS storage unit 36. Further note that EC data slices of the samepillar number but of different segments (e.g., EC data slice 1 of datasegment 1 and EC data slice 1 of data segment 2) may be stored on thesame or different DS storage units 36.

The storage module 84 performs an integrity check on the outboundencoded data slices and, when successful, identifies a plurality of DSstorage units based on information provided by the grid module 82. Thestorage module 84 then outputs the encoded data slices 1 through X ofeach segment 1 through Y to the DS storage units 36. Each of the DSstorage units 36 stores its EC data slice(s) and maintains a localvirtual DSN address to physical location table to convert the virtualDSN address of the EC data slice(s) into physical storage addresses.

In an example of a read operation, the user device 12 and/or 14 sends aread request to the DS processing unit 16, which authenticates therequest. When the request is authentic, the DS processing unit 16 sendsa read message to each of the DS storage units 36 storing slices of thedata object being read. The slices are received via the DSnet interface32 and processed by the storage module 84, which performs a parity checkand provides the slices to the grid module 82 when the parity check wassuccessful. The grid module 82 decodes the slices in accordance with theerror coding dispersal storage function to reconstruct the data segment.The access module 80 reconstructs the data object from the data segmentsand the gateway module 78 formats the data object for transmission tothe user device.

FIG. 4 is a schematic block diagram of an embodiment of a grid module 82that includes a control unit 73, a pre-slice manipulator 75, an encoder77, a slicer 79, a post-slice manipulator 81, a pre-slice de-manipulator83, a decoder 85, a de-slicer 87, and/or a post-slice de-manipulator 89.Note that the control unit 73 may be partially or completely external tothe grid module 82. For example, the control unit 73 may be part of thecomputing core at a remote location, part of a user device, part of theDS managing unit 18, or distributed amongst one or more DS storageunits.

In an example of a write operation, the pre-slice manipulator 75receives a data segment 90-92 and a write instruction from an authorizeduser device. The pre-slice manipulator 75 determines if pre-manipulationof the data segment 90-92 is required and, if so, what type. Thepre-slice manipulator 75 may make the determination independently orbased on instructions from the control unit 73, where the determinationis based on a computing system-wide predetermination, a table lookup,vault parameters associated with the user identification, the type ofdata, security requirements, available DSN memory, performancerequirements, and/or other metadata.

Once a positive determination is made, the pre-slice manipulator 75manipulates the data segment 90-92 in accordance with the type ofmanipulation. For example, the type of manipulation may be compression(e.g., Lempel-Ziv-Welch, Huffman, Golomb, fractal, wavelet, etc.),signatures (e.g., Digital Signature Algorithm (DSA), Elliptic Curve DSA,Secure Hash Algorithm, etc.), watermarking, tagging, encryption (e.g.,Data Encryption Standard, Advanced Encryption Standard, etc.), addingmetadata (e.g., time/date stamping, user information, file type, etc.),cyclic redundancy check (e.g., CRC32), and/or other data manipulationsto produce the pre-manipulated data segment.

The encoder 77 encodes the pre-manipulated data segment 92 using aforward error correction (FEC) encoder (and/or other type of erasurecoding and/or error coding) to produce an encoded data segment 94. Theencoder 77 determines which forward error correction algorithm to usebased on a predetermination associated with the user’s vault, a timebased algorithm, user direction, DS managing unit direction, controlunit direction, as a function of the data type, as a function of thedata segment 92 metadata, and/or any other factor to determine algorithmtype. The forward error correction algorithm may be Golay,Multidimensional parity, Reed-Solomon, Hamming, Bose Ray ChauduriHocquenghem (BCH), Cauchy-Reed-Solomon, or any other FEC encoder. Notethat the encoder 77 may use a different encoding algorithm for each datasegment 92, the same encoding algorithm for the data segments 92 of adata object, or a combination thereof.

The encoded data segment 94 is of greater size than the data segment 92by the overhead rate of the encoding algorithm by a factor of X/T, whereX is the width or number of slices, and T is the read threshold. In thisregard, the corresponding decoding process can accommodate at most X-Tmissing EC data slices and still recreate the data segment 92. Forexample, if X=16 and T=10, then the data segment 92 will be recoverableas long as 10 or more EC data slices per segment are not corrupted.

The slicer 79 transforms the encoded data segment 94 into EC data slicesin accordance with the slicing parameter from the vault for this userand/or data segment 92. For example, if the slicing parameter is X = 16,then the slicer 79 slices each encoded data segment 94 into 16 encodedslices.

The post-slice manipulator 81 performs, if enabled, post-manipulation onthe encoded slices to produce the EC data slices. If enabled, thepost-slice manipulator 81 determines the type of post-manipulation,which may be based on a computing system-wide predetermination,parameters in the vault for this user, a table lookup, the useridentification, the type of data, security requirements, available DSNmemory, performance requirements, control unit directed, and/or othermetadata. Note that the type of post-slice manipulation may includeslice level compression, signatures, encryption, CRC, addressing,watermarking, tagging, adding metadata, and/or other manipulation toimprove the effectiveness of the computing system.

In an example of a read operation, the post-slice de-manipulator 89receives at least a read threshold number of EC data slices and performsthe inverse function of the post-slice manipulator 81 to produce aplurality of encoded slices. The de-slicer 87 de-slices the encodedslices to produce an encoded data segment 94. The decoder 85 performsthe inverse function of the encoder 77 to recapture the data segment90-92. The pre-slice de-manipulator 83 performs the inverse function ofthe pre-slice manipulator 75 to recapture the data segment 90-92.

FIG. 5 is a diagram of an example of slicing an encoded data segment 94by the slicer 79. In this example, the encoded data segment 94 includesthirty-two bits, bytes, data words, etc., but may include more or lessbits, bytes, data words, etc. The slicer 79 disperses the bits of theencoded data segment 94 across the EC data slices in a pattern as shown.As such, each EC data slice does not include consecutive bits, bytes,data words, etc. of the data segment 94 reducing the impact ofconsecutive bit, byte, data word, etc. failures on data recovery. Forexample, if EC data slice 2 (which includes bits 1, 5, 9, 13, 17, 25,and 29) is unavailable (e.g., lost, inaccessible, or corrupted), thedata segment can be reconstructed from the other EC data slices (e.g.,1, 3 and 4 for a read threshold of 3 and a width of 4).

FIG. 6A is a schematic block diagram of an embodiment of a storagemodule 84. The storage module 84 includes a plurality of encryptors 1-N,a plurality of appenders 1-N, a plurality of information dispersalalgorithm (IDA) encoders 1-N, a plurality of deterministic functions(DF) 1-N, a plurality of random key generators (RKG) 1-N, a plurality ofexclusive OR functions (XOR) 1A-NA, a plurality of exclusive ORfunctions (XOR) 1B-NB, a plurality of IDA decoders 1-N, a plurality ofsplitters 1-N, and a plurality of decryptors 1-N, all of which may beimplemented as one or more modules. Data for storage in a dispersedstorage network (DSN) memory 22 is presented as a plurality of data 1-N(e.g., data segments 1-N of data) to the storage module 84. The storagemodule 84 dispersed storage error encodes each data segment of theplurality of data segments 1-N to produce a plurality of sets 1-N ofencoded data slices for storage in the DSN memory 22. The storage module84 receives the plurality of sets 1-N of encoded data slices from theDSN memory 22 and dispersed storage error decodes each set of theplurality of sets 1-N of encoded data slices to reproduce the pluralityof sets of data segments 1-N to reproduce the data.

RKGs 1-N generate a plurality of keys 1-N based on a key generatingapproach. The key generating approach may be based on one or more of akey seed, a pseudorandom sequence, a random number generator, apredetermined list, a lookup, a private key retrieval, and public-keyretrieval, a public/private key pair generation, and a key generationalgorithm. The encryptors 1-N encrypt data segments 1-N to produce aplurality of encrypted data 1-N utilizing keys 1-N. The deterministicfunctions 1-N perform a deterministic function on encrypted data 1-N toproduce a plurality of deterministic values 1-N in accordance with adeterministic function algorithm. The deterministic function algorithmincludes at least one of a mathematical function (e.g., addition,subtraction, division, multiplication, etc.), a hashing function, achecksum function (e.g., a cyclic redundancy check), a hash-basedmessage authentication code (HMAC), a mask generating function (MGF),and a compression function (e.g., repeated applications of a bitwiseexclusive OR). For example, deterministic function 1 performs a hashingfunction on encrypted data 1 to produce deterministic value 1.

The plurality of XOR functions 1A-NA mask the plurality of keys 1-N toproduce a plurality of masked keys (MK) 1-N in accordance with a maskingfunction. The masking function includes selecting at least onedeterministic value of the plurality of deterministic values 1-N toproduce a selected deterministic value and performing a logical XORfunction on a corresponding key of the plurality of keys 1-N with theselected deterministic value to produce a corresponding masked key ofthe plurality of masked keys 1-N. The selecting may be based on or moreof a user identity (ID), a vault ID, a lookup, a predetermination, asecurity requirement, a data type indicator, a data size indicator, adata ID, a filename, and dispersal parameters. For example, XOR 1Aselects DV 2 based on a dispersal parameter that indicates to utilize adeterministic value of an adjacent data segment.

The plurality of appenders 1-N append the plurality of masked keys 1-Nto the plurality of encrypted data 1-N to produce a plurality of securepackages 1-N based on an appending approach. Each masked key of theplurality of masked keys 1-N is appended to at least one encrypted dataof the plurality of encrypted data 1-N. At least one of the securepackages of the plurality of secure packages 1-N includes one or moremasked keys of the plurality of mass keys 1-N. The appending approachincludes selecting a masked key of the plurality of masked keys 1-N inaccordance with a selecting approach to produce one or more selectedmasked keys when a masked key is selected and one of appending the oneor more selected masked keys to a corresponding encrypted data toproduce a corresponding secure package when the masked key is selectedor providing the corresponding encrypted data as the correspondingsecure package when the masked key is not selected. The selectingapproach may be based on or more of the user identity (ID), the vaultID, a lookup, a predetermination, a security requirement, the data typeindicator, the data size indicator, the data ID, the filename, and thedispersal parameters. For example, appender 1 selects MK 2 based on adispersal parameter that indicates to utilize a masked key of anadjacent data segment. As another example, appender 2 selects MK 3 andMK 4 based on a masked key selection table lookup.

The plurality of IDA encoders 1-N dispersed storage error encode theplurality of secure packages 1-N in accordance with the dispersalparameters to produce the plurality of sets 1-N of encoded data slices.For example, IDA encoder N dispersed storage error encodes securepackage N to produce slice set N of encoded data slices in accordancewith the dispersal parameters. The plurality of sets 1-N of encoded dataslices IS sent to the DSN memory 22 for storage therein.

The plurality of IDA decoders 1-N receive the plurality of sets 1-N ofencoded data slices from the DSN memory 22 and dispersed storage errordecode the plurality of sets 1-N of encoded data slices in accordancewith the dispersal parameters to reproduce the plurality of sets ofsecure packages 1-N. For example, IDA decoder 3 receives slice set 3 ofencoded data slices and dispersed storage error decodes slice set 3 inaccordance with the dispersal parameters to reproduce secure package 3.

The splitters 1-N splits the secure packages 1-N into the plurality ofencrypted data 1-N and the plurality of masked keys X1-XN in accordancewith a splitting approach. The splitting approach may be based on ormore of the user identity (ID), the vault ID, a lookup, apredetermination, a security requirement, the data type indicator, thedata size indicator, the data ID, the filename, and the dispersalparameters. For example, splitter 1 splits secure package 1 intoencrypted data 1 and MK 2 as X1 based on a dispersal parameter thatindicates that MK 2 was appended to encrypted data 1. As anotherexample, splitter 2 splits secure package 2 into encrypted data 2 and MK3, MK 4 as X2 based on a masked key selection table lookup. Thedeterministic functions 1-N perform a deterministic function on theplurality of encrypted data 1-N to reproduce the plurality ofdeterministic values 1-N in accordance with the deterministic functionalgorithm.

The plurality of XOR functions 1B-NB unmasks the plurality of maskedkeys 1-N of masked keys X1-XN to reproduce the plurality of keys 1-N inaccordance with an unmasking function. The unmasking function includesselecting at least one deterministic value of the plurality ofdeterministic values 1-N in accordance with a decode selecting approachto produce a selected deterministic value and performing a logical XORfunction on a corresponding masked key of the plurality of masked keys1-N with the selected deterministic value to reproduce a correspondingkey of the plurality of keys 1-N as a reproduced key. The decodeselecting approach may be based on one or more of the user identity(ID), the vault ID, a lookup, a predetermination, a securityrequirement, the data type indicator, the data size indicator, the dataID, the filename, and dispersal parameters. For example, XOR 1B selectsDV 2 as the selected deterministic value based on a dispersal parameterthat indicates to utilize a deterministic value of an adjacent datasegment and performs the logical XOR function on MK1 and DV2 toreproduce key 1. The plurality of decryptors 1-N decrypt the pluralityof encrypted data 1-N utilizing the plurality of reproduced keys 1-N toreproduce data 1-N to reform the data. For example, decryptor 4 decryptsencrypted data segment 4 utilizing reproduced key 4 to reproduce data 4.

FIG. 6B is a schematic block diagram of another embodiment of a storagemodule that includes a distributed/dispersed storage (DS) module 102.The DS module 102 may be implemented utilizing at least one of a userdevice, a DS processing unit, and a DS unit. The DS module 102 includesan encrypt module 104, a generate deterministic values module 106, anestablish pattern module 108, a generate masked keys module 110, andappend module 112, and an output module 114. The DS module 102 isoperable to process a plurality of data segments 116 to produce aplurality of sets of encoded data slices 118.

The encrypt module 104 encrypts the plurality of data segments 116 ofdata using a plurality of encryption keys 122 to produce a plurality ofencrypted data segments 120. The encrypt module 104 further functions togenerate the plurality of encryption keys 122 using a plurality ofrandom key generation functions. For example, for each data segment ofthe plurality of data segments 116, the encrypt module 104 generates arandom number, generates an encryption key based on the random number,and encrypts the data segment to produce a corresponding encrypted datasegment.

The generate deterministic values module 106 generates a plurality ofdeterministic values 124 from the plurality of encrypted data segments120 using one or more deterministic functions. The one or moredeterministic functions includes one or more of a hash function, a maskgenerating function (MGF), and a hash-based message authentication code(HMAC) function. For example, for each encrypted data segment, thegenerate deterministic values module 106 performs the hash function onthe encrypted data segment to produce a corresponding deterministicvalue. The generate deterministic values module 106 may select the oneor more deterministic functions in accordance with a data interminglingpattern 126. For example, the generate deterministic values module 106selects the HMAC function for a first encrypted data segment and selectsthe MGF function for a second encrypted data segment when the dataintermingling pattern 126 specifies the HMAC function for the firstencrypted data segment and the MGF function for the second encrypteddata segment.

The establish pattern module 108 establishes the data interminglingpattern 126 for the plurality of encrypted data segments 120. Theestablish pattern module 108 establishes the data intermingling pattern126 to include a first selection pattern to select one or more of theplurality of deterministic values 124, a second selection pattern forassociating each of the plurality of encryption keys 122 with at leastone corresponding one of the selected one or more of the plurality ofdeterministic values 124, and a third selection pattern for associatingeach of the plurality of encrypted data segments 120 with at least onecorresponding one of a plurality of masked keys 128. The establishpattern module 108 establishes the data intermingling pattern 126 suchthat each of the first, second, and third selection pattern is based onone or more of a pseudorandom sequence based on a seed number (e.g., areceiving entity has same seed), a predetermination, hard coding (e.g.,a fixed pattern), a previous first, second, or third selection pattern,and a segment number mapping.

The generate masked keys module 110 generates the plurality of maskedkeys 128 by selecting one or more of the plurality of deterministicvalues 124 in accordance with the data intermingling pattern 126 andperforming a masking function on the plurality of encryption keys 122and the selected one or more of the plurality of deterministic values124. The masking function includes at least one of an arithmeticfunction and a logical function. The logical function includes at leastone of an exclusive OR function, an AND function, and an OR function.For example, the generate masked keys module 110 generates a firstmasked key by performing the exclusive OR function on a first encryptionkey and a 10th deterministic value when the data intermingling pattern126 indicates to select the 10th deterministic value for the firstencryption key.

The append module 112 appends the plurality of masked keys 128 to theplurality of encrypted data segments 120 in accordance with the dataintermingling pattern 126 to produce a plurality of secure data packages130. The appending includes at least one of appending a masked key to anend of an encrypted data segment, interleaving the masked key with theencrypted data segment, and inserting the masked key within theencrypted data segment. For example, the append module 112 appends a20th masked key to a trailing end of a first encrypted data segment toproduce a first secure data package when the data intermingling pattern126 indicates to utilize the 20th masked key with the first encrypteddata segment.

The output module 114 outputs the plurality of secure data packages 130for storage. The output module 114 outputs the plurality of secure datapackages by performing a dispersed storage error encoding function onthe plurality of secure data packages 130 to produce the plurality ofsets of encoded data slices 118 and outputs the plurality of sets ofencoded data slices 118. The outputting includes at least one of storingthe plurality of sets of encoded data slices 118 in a dispersed storagenetwork memory and transmitting the plurality of sets of encoded dataslices 118 to a receiving entity.

FIG. 6C is a flowchart illustrating an example of storing data. Themethod begins at step 132 where a processing module (e.g., of adispersed storage (DS) module) encrypts a plurality of data segments ofdata using a plurality of encryption keys to produce a plurality ofencrypted data segments. The processing module may generate theplurality of encryption keys using a plurality of random key generationfunctions. The method continues at step 134 where the processing modulegenerates a plurality of deterministic values from the plurality ofencrypted data segments using one or more deterministic functions.

The method continues at step 136 where the processing module establishesa data intermingling pattern for the plurality of encrypted datasegments. The data intermingling pattern includes a first selectionpattern to select one or more of the plurality of deterministic values,a second selection pattern for associating each of the plurality ofencryption keys with at least one corresponding one of the selected oneor more of the plurality of deterministic values, and a third selectionpattern for associating each of the plurality of encrypted data segmentswith at least one corresponding one of a plurality of masked keys. Theestablishing the data intermingling pattern for each of the first,second, and third selection pattern is based on one or more of apseudorandom sequence based on a seed number (e.g., a receiving entityhas same seed), a predetermination, hard coding (e.g., a fixed pattern),a previous first, second, or third selection pattern, and a segmentnumber mapping.

The method continues at step 138 where the processing module generatesthe plurality of masked keys by selecting one or more of the pluralityof deterministic values in accordance with the data interminglingpattern and performing a masking function on the plurality of encryptionkeys and the selected one or more of the plurality of deterministicvalues. The method continues at step 140 where the processing moduleappends the plurality of masked keys to the plurality of encrypted datasegments in accordance with the data intermingling pattern to produce aplurality of secure data packages. The method continues at step 142where the processing module outputs the plurality of secure datapackages for storage. The outputting the plurality of secure datapackages includes performing a dispersed storage error encoding functionon the plurality of secure data packages to produce a plurality of setsof encoded data slices and outputting the plurality of sets of encodeddata slices.

FIG. 6D is a schematic block diagram of another embodiment of a storagemodule that includes a distributed/dispersed storage (DS) module 150.The DS module 150 may be implemented utilizing at least one of a userdevice, a DS processing unit, and a DS unit. The DS module 150 includesa receive module 152, an establish pattern module 154, a segregatemodule 156, a generate deterministic values module 158, a de-mask module160, and a decrypt module 162. The DS module 150 is operable to processa plurality of secure data packages 130 to produce a plurality of datasegments 116 of stored data.

The receive module 152 retrieves the plurality of secure data packages130. The receive module 152 retrieves the plurality of secure datapackages 130 by at least one of retrieving a plurality of sets ofencoded data slices 118 and receiving the plurality of secure datapackages 130 (e.g., directly). The receive module 152 retrieves theplurality of secure data packages 130 by retrieving the plurality ofsets of encoded data slices 118 (e.g., retrieve a dispersed storagenetwork memory, receive from a sending entity) and performing adispersed storage error decoding function on the plurality of sets ofencoded data slices to produce the plurality of secure data packages 130when receiving the plurality of secure data packages 130 as theplurality of sets of encoded data slices 118.

The establish pattern module 154 establishes a data interminglingpattern 164 for the plurality of secure data packages 130. The dataintermingling pattern 164 includes a first selection pattern to select aone or more of a plurality of deterministic values 124, a secondselection pattern for associating each of a plurality of encryption keys122 with at least one corresponding one of the plurality ofdeterministic values 124, and a third selection pattern for associatingeach of a plurality of encrypted data segments 120 with at least onecorresponding one of the plurality of encryption keys 122. The establishpattern module 154 establishes the data intermingling pattern 126 suchthat each of the first, second, and third selection pattern is based onone or more of a pseudorandom sequence based on a seed number, apredetermination, hard coding, a previous first, second, or thirdselection pattern, and a segment number mapping.

The segregate module 156 segregates the plurality of secure datapackages 130 in accordance with the data intermingling pattern 126 toproduce a plurality of masked keys 128 and the plurality of encrypteddata segments 120. The generate deterministic values module 158generates the plurality of deterministic values 124 from the pluralityof encrypted data segments 120 using one or more deterministicfunctions. The one or more deterministic functions includes one or moreof a hash function, a mask generating function, and a hash-based messageauthentication code (HMAC) function. The generate deterministic valuesmodule 158 may select the one or more deterministic functions inaccordance with the data intermingling pattern 126.

The de-mask module 160 performs a masking function on the plurality ofmasked keys 128 and the plurality of deterministic values 124 inaccordance with the data intermingling pattern 126 to produce theplurality of encryption keys 122. For example, the de-mask module 160performs an exclusive OR function on a 20th masked key and a 10thdeterministic value to produce a first encryption key when the dataintermingling pattern 126 indicates to select the 10th deterministicvalue and the 20th masked key for the first encryption key. The decryptmodule 162 decrypts the plurality of encrypted data segments 120 usingthe plurality of encryption keys 122 to produce the plurality of datasegments 116 of the stored data. For example, the decrypt module 162decrypts a first encrypted data segment using the first encryption keyto produce a first data segment.

FIG. 6E is a flowchart illustrating an example of retrieving storeddata. The method begins at step 166 where a processing module (e.g., ofa dispersed storage (DS) module) retrieves a plurality of secure datapackages. The retrieving the plurality of secure data packages includesretrieving a plurality of sets of encoded data slices (e.g., retrieve aDSN memory, receive from a sending entity) and performing a dispersedstorage error decoding function on the plurality of sets of encoded dataslices to produce the plurality of secure data packages.

The method continues at step 168 where the processing module establishesa data intermingling pattern for the plurality of secure data packages.The data intermingling pattern includes a first selection pattern toselect a one or more of a plurality of deterministic values, a secondselection pattern for associating each of a plurality of encryption keyswith at least one corresponding one of the plurality of deterministicvalues, and a third selection pattern for associating each of aplurality of encrypted data segments with at least one corresponding oneof the plurality of encryption keys. The establishing the dataintermingling pattern includes establishing each of the first, second,and third selection pattern is based on one or more of a pseudorandomsequence based on a seed number, a predetermination, hard coding, aprevious first, second, or third selection pattern, and a segment numbermapping.

The method continues at step 170 where the processing module segregatesthe plurality of secure data packages in accordance with the dataintermingling pattern to produce a plurality of masked keys and aplurality of encrypted data segments. The method continues at step 172where the processing module generates a plurality of deterministicvalues from the plurality of encrypted data segments using one or moredeterministic functions. The method continues at step 174 where theprocessing module performs a masking function on the plurality of maskedkeys and the plurality of deterministic values in accordance with thedata intermingling pattern to produce a plurality of encryption keys.The method continues at step 176 where the processing module decryptsthe plurality of encrypted data segments using the plurality ofencryption keys to produce a plurality of data segments of the storeddata.

FIG. 7A is a schematic block diagram of another embodiment of a storagemodule 84. The storage module 84 includes a plurality of encryptors 1-N,a plurality of appenders 1-N, a plurality of information dispersalalgorithm (IDA) encoders 1-N, a plurality of random key generators (RKG)1-N, a key IDA encoder, a plurality of IDA decoders 1-N, a plurality ofsplitters 1-N, a plurality of decryptors 1-N, and a key IDA decoder, allof which may be implemented as one or more modules. Data for storage ina dispersed storage network (DSN) memory 22 is presented as a pluralityof data 1-N (e.g., data segments 1-N) to the storage module 84. Thestorage module 84 dispersed storage error encodes each data segment ofthe plurality of data segments 1-N to produce a plurality of sets 1-N ofencoded data slices for storage in the DSN memory 22. The storage module84 receives the plurality of sets 1-N of encoded data slices from theDSN memory 22 and dispersed storage error decodes each set of theplurality of sets 1-N of encoded data slices to reproduce the pluralityof sets of data segments 1-N to reproduce the data.

RKGs 1-N generate a plurality of keys 1-N based on a key generatingapproach. The encryptors 1-N encrypt data segments 1-N to produce aplurality of encrypted data 1-N utilizing keys 1-N. The key IDA encoderdispersed storage error encodes the plurality of keys 1-N in accordancewith dispersal parameters to produce key slices 1-N. The encodingincludes one or more of selecting one or more keys of the plurality ofkeys 1-N to produce one or more key packages of a plurality of keypackages and dispersed storage error encoding the plurality of keypackages to produce the key slices 1-N. The key slices 1-N each includeone or more encoded key slices. For example, key slices 1 includes a setof encoded key slices generated by dispersed storage error encoding akey package that includes key 1. As another example, key slices 2includes at least some encoded key slices of a set of encoded key slicesgenerated by dispersed storage error encoding a key package thatincludes key 2 and at least some encoded key slices of the set ofencoded key slices generated by dispersed storage error encoding the keypackage that includes key 1.

The appenders 1-N append the plurality of key slices 1-N to theplurality of an encrypted data 1-N to produce a plurality of securepackages 1-N based on an appending approach. The appending may includeone or more of selecting key slices of the plurality of key slices 1-Nand appending selected key slices to corresponding encrypted data of theplurality of encrypted data 1-N to produce a secure package of theplurality of secure packages 1-N. The appending approach may be based onor more of a user identity (ID), a vault ID, a lookup, apredetermination, a security requirement, a data type indicator, a datasize indicator, a data ID, a filename, and dispersal parameters. Forexample, appender 1 appends selected key slices 1 to encrypted data 1when a dispersal parameter indicates to utilize a key slices 1 output ofthe key IDA encoder for encrypted data 1. As another example, appender 1appends selected key slices 1 and key slices 2 to encrypted data 1 whena dispersal parameter indicates to utilize key slices associated with afirst to data segments.

The plurality of IDA encoders 1-N dispersed storage error encode theplurality of secure packages 1-N in accordance with the dispersalparameters to produce the plurality of sets 1-N of encoded data slices.The plurality of sets 1-N of encoded data slices are sent to the DSNmemory 22 for storage therein. The plurality of IDA decoders 1-N receivethe plurality of sets 1-N of encoded data slices from the DSN memory 22and dispersed storage error decode the plurality of sets 1-N of encodeddata slices in accordance with the dispersal parameters to reproduce theplurality of sets of secure packages 1-N.

The splitters 1-N splits the secure packages 1-N into the plurality ofencrypted data 1-N and the plurality of key slices 1-N in accordancewith a splitting approach. The splitting approach may be based on ormore of the user identity (ID), the vault ID, a lookup, apredetermination, a security requirement, the data type indicator, thedata size indicator, the data ID, the filename, and the dispersalparameters. For example, splitter 1 splits secure package 1 intoencrypted data 1 and key slices 1 based on a dispersal parameter thatindicates that key slices 1 was appended to encrypted data 1. As anotherexample, splitter 2 splits secure package 2 into encrypted data 2 andkey slices 1-2 based on a key slices selection table lookup.

The key IDA decoder dispersed storage error decodes the plurality of keyslices 1-N in accordance with dispersal parameters to reproduce keys1-N. The decoding includes one or more of selecting one or more keyslices of the plurality of key slices 1-N to produce one or more keyslice packages of a plurality of key slice packages and dispersedstorage error decoding the plurality of key slice packages to reproducekeys 1-N. For example, key slices 1 are dispersed storage error decodedto reproduce key 1. As another example, key slices 1 and 2 are dispersedstorage error decoded to reproduce key 1.

The plurality of decryptors 1-N decrypt the plurality of encrypted data1-N utilizing the plurality of reproduced keys 1-N to reproduce data 1-Nto reform the data. For example, decryptor 3 decrypts encrypted datasegment 3 utilizing reproduced key 3 to reproduce data 3.

FIG. 7B is a flowchart illustrating another example of encoding data.The method begins with step 180 where a processing module (e.g., of adispersed storage processing module, of a storage module) encrypts aplurality of data segments of data utilizing a plurality of keys toproduce a plurality of encrypted data segments. The method continues atstep 182 where the processing module dispersed storage error encodes theplurality of keys to produce one or more sets of encoded key slices. Theencoding includes one or more of selecting one or more keys of theplurality of keys to produce one or more key packages of a plurality ofkey packages and dispersed storage error encoding the plurality of keypackages to produce the one of more sets of encoded key slices.

The method continues at step 184 where the processing module, for eachencrypted data segment of the plurality of encrypted data segments,appends one or more encoded key slices of the one or more sets ofencoded key slices to produce a corresponding secure package of aplurality of secure packages based on an appending approach. Theappending may include one or more of selecting encoded key slices of theone of more sets of encoded key slices and appending selected key slicesto corresponding encrypted data of the plurality of encrypted data toproduce a secure package of the plurality of secure packages. The methodcontinues at step 186 where the processing module dispersed storageerror encodes the plurality of secure packages to produce a plurality ofsets of encoded data slices.

FIG. 7C is a flowchart illustrating another example of decoding data.The method begins with step 188 where a processing module (e.g., of adispersed storage processing module, of a storage module) dispersedstorage error decodes a plurality of sets of encoded data slices toreproduce a plurality of secure packages. The method continues at step190 where the processing module, for each secure package of theplurality of secure packages, splits out one or more encoded key slicesof one or more sets of encoded key slices and a corresponding encrypteddata segment in accordance with a splitting approach. The splittingapproach may be based on or more of a user identity (ID), a vault ID, alookup, a predetermination, a security requirement, a data typeindicator, a data size indicator, a data ID, a filename, and a dispersalparameter.

The method continues at step 192 where the processing module dispersedstorage error decodes the one or more sets of encoded key slices toreproduce a plurality of keys in accordance with a dispersal parameter.The decoding includes one or more of selecting one or more key slices ofthe one or more sets of encoded of key slices to produce one or more keyslice packages of a plurality of key slice packages and dispersedstorage error decoding the plurality of key slice packages to reproducethe plurality of keys. The method continues at step 194 where theprocessing module decrypts the plurality of encrypted data segmentsutilizing the plurality of keys to reproduce a plurality of datasegments to reproduce the data.

FIG. 8A is a schematic block diagram of another embodiment of a storagemodule 84. The storage module 84 includes a plurality of encryptors1A-NA and 1B-NB, a plurality of appenders 1A-NA and 1B-NB, a pluralityof information dispersal algorithm (IDA) encoders 1-N, a plurality ofrandom key generators (RKG) 1A-NA and 1B-NB, a key onion IDA encoder, aplurality of IDA decoders 1-N, a plurality of splitters 1A-NA and 1B-NB,a plurality of decryptors 1A-NA and 1B-NB, and a key onion IDA decoder,all of which may be implemented as one or more modules. Data for storagein a dispersed storage network (DSN) memory 22 is presented as aplurality of data 1-N (e.g., a plurality of data segments 1-N) to thestorage module 84. The storage module 84 dispersed storage error encodeseach data segment of the plurality of data segments 1-N to produce aplurality of sets 1-N of encoded data slices for storage in the DSNmemory 22. The storage module 84 receives the plurality of sets 1-N ofencoded data slices from the DSN memory 22 and dispersed storage errordecodes each set of the plurality of sets 1-N of encoded data slices toreproduce the plurality of sets of data segments 1-N to reproduce thedata.

RKGs 1A-NA generate a plurality of keys 1A-N based on a key generatingapproach. RKGs 1B-NB generate a plurality of keys 1B-NB based on the keygenerating approach and may retrieve keys 1B-NB from a local memory ofone or more local memories associated with the encoding of each data ofthe plurality of data 1-N. The encryptors 1A-NA encrypt data segments1-N to produce a plurality of encrypted data 1-N utilizing keys 1A-NA.

The appenders 1B-NB append the plurality of keys 1B-NB to the pluralityof an encrypted data 1-N to produce a plurality of secure packages 1-Nbased on an appending approach. The appending may include one or more ofselecting a key of the plurality of keys 1B-NB and appending theselected key to a corresponding encrypted data of the plurality ofencrypted data 1-N to produce a secure package of the plurality ofsecure packages 1-N. The appending approach may be based on or more of auser identity (ID), a vault ID, a lookup, a predetermination, a securityrequirement, a data type indicator, a data size indicator, a data ID, afilename, and dispersal parameters. For example, appender 1B appendsselected key 1B to encrypted data 1 when a dispersal parameter indicatesto utilize a corresponding key for encrypted data 1. As another example,appender 1B appends selected key 2B to encrypted data 1 when a dispersalparameter indicates to utilize a key associated with a next datasegment.

The appenders 1A-NA append a plurality of levels of post-encryption keyonions 1 through N-1 to the plurality of keys 1A-NA to produce aplurality of levels of pre-encryption key onions 1 through N-1 based onan appending approach when a key of the plurality of keys 1A-NA is to beappended to a post-encryption key onion (e.g., no appending is requiredfor a first level). A key onion includes one or more of a levelindicator, a previous level encrypted key onion, a list of a pluralityof levels, a next level indicator, a next level entity ID, a list of aplurality of entities wherein each entity is associated with at leastone level of the plurality of levels, routing information (e.g.,internet protocol (IP) addresses associated with the plurality ofentities), and a corresponding level key that corresponds to the levelindicator. The plurality of encryptors 1B-NB encrypt the plurality oflevels of pre-encryption key onions 1 through N-1 utilizing theplurality of keys 1B-NB to produce the plurality of levels ofpost-encryption key onions 1 through N-1.

For example, a post-encryption key onion 2 (e.g., for level 2) includespre-encryption key onion 2 content encrypted by encryptor 2B utilizingkey 2B. The pre-encryption key onion 2 content includes key 2A appendedby appender 2B with post-encryption key onion 1 (e.g., encryptedutilizing key 1B associated with level 1), a level 2 indicator, and anext level indicator of 3. As another example, for the first level, apost-encryption key onion 1 (e.g., for level 1) includes pre-encryptionkey onion 1 content encrypted by encryptor 1B utilizing key 1B, whereinthe pre-encryption key onion 1 content includes key 1A appended byappender 1A with a level 1 indicator, and a next level indicator of 2.As yet another example, a post-encryption key onion N (e.g., for levelN) includes pre-encryption key onion N-1 content encrypted by encryptorNB utilizing key (N-1)B. The pre-encryption key onion N-1 contentincludes key NA appended by appender NA with post-encryption key onionN-1 (e.g., encrypted utilizing key (N-1)B associated with level N-1), alevel N indicator, and a next level indicator of none.

A final level encryptor of the plurality of encryptors 1B-NB provides afinal level key onion to the key onion IDA encoder. The key onion IDAencoder dispersed storage error encodes the final level key onion toproduce one or more sets of onion slices for storage in the DSN memory22. For example, encryptor NB provides key onion N to the key onion IDAencoder. The key onion IDA encoder dispersed storage error encodes keyonion N to produce the one of more sets of onion slices for storage inthe DSN memory 22.

The plurality of IDA encoders 1-N dispersed storage error encode theplurality of secure packages 1-N in accordance with the dispersalparameters to produce the plurality of sets 1-N of encoded data slices.The plurality of sets 1-N of encoded data slices are sent to the DSNmemory 22 for storage therein. The plurality of IDA decoders 1-N receivethe plurality of sets 1-N of encoded data slices from the DSN memory 22and dispersed storage error decode the plurality of sets 1-N of encodeddata slices in accordance with the dispersal parameters to reproduce theplurality of sets of secure packages 1-N. The key onion IDA decoderretrieves the one or more sets of onion slices from the DSN memory 22and dispersed storage error decodes the one or more sets of onion slicesto reproduce a final level key onion. For example, the key onion IDAdecoder retrieves the one or more sets of onion slices from the DSNmemory and dispersed storage error decodes the one of more sets of onionslices to reproduce key onion N for presentation to decryptor NB of theplurality of decryptors 1B-NB.

The splitters 1B-NB splits the plurality of secure packages 1-N into theplurality of encrypted data 1-N and the plurality of keys 1B-NB inaccordance with a splitting approach. The splitting approach may bebased on or more of the user identity (ID), the vault ID, a lookup, apredetermination, a security requirement, the data type indicator, thedata size indicator, the data ID, the filename, and the dispersalparameters. For example, splitter 1B splits secure package 1 intoencrypted data 1 and key 1B based on a dispersal parameter thatindicates that key 1B was appended to encrypted data 1. As anotherexample, splitter 2B splits secure package 2 into encrypted data 2 andkey 2B based on a key recovery table lookup. As yet another example,splitter 3B extracts encrypted data 3 from secure package 3 andretrieves key 3B from a local key memory based on a securityrequirement.

The plurality of decryptors 1B-NB decrypt the plurality of key onionlevels 1-N utilizing the plurality of keys 1B-NB to reproduce acorresponding plurality of key onion content and the splitters 1A-NAsplit the plurality of key onion content to extract the plurality ofkeys 1A-NA and subsequent key onion levels N-1 through 1 provided to asubsequent level decryptor. When decoding the data, a first decryptingand splitting of a key onion starts with a highest level of key onion.For example, decryptor NB decrypts key onion N utilizing key NB toproduce key onion content that is split by splitter NA to extract keyonion N-1 and key NA. Next, splitter NA sends key onion N-1 to decryptor(N-1)B based on a next level recipient identifier of the key onioncontent. As another example, decryptor 2B decrypts key onion 2 utilizingkey 2B to produce key onion content that is split by splitter 2A toextract key onion 1 and key 2A. Next, splitter 2A sends key onion 1 todecryptor 1B based on a next level recipient identifier of the canyoncontent. When decoding a data segment that was encoded first, thesplitting of the corresponding key onion content includes extracting acorresponding key without extracting a subsequent key onion level. Forexample, decryptor 1B decrypts key onion 1 utilizing key 1B to producekey onion content that is split by splitter 1A to extract key 1A.

The plurality of decryptors 1-N decrypt the plurality of encrypted data1-N utilizing the plurality of reproduced keys 1-N to reproduce data 1-Nto reform the data. For example, decryptor 3 decrypts encrypted datasegment 3 utilizing reproduced key 3 to reproduce data 3.

FIG. 8B is a flowchart illustrating another example of encoding data,which includes similar steps to FIG. 7B. The method begins with step 196where a processing module (e.g., of a dispersed storage processingmodule, of a storage module) encrypts a plurality of data segments ofdata utilizing a first plurality of keys to produce a plurality ofencrypted data segments. For example, the processing module encryptsdata segment 3 utilizing key 3A of a plurality of keys 1A-NA to producean encrypted data segment 3.

The method continues at step 198 where the processing module, for eachencrypted data segment of the plurality of encrypted data segments,appends a corresponding key of a second plurality of keys to produce acorresponding secure package of a plurality of secure packages. Theappending may include one or more of selecting a key of the plurality ofkeys 1B-NB and appending the selected key to a corresponding encrypteddata of the plurality of encrypted data 1-N to produce a secure packageof the plurality of secure packages 1-N. The appending approach may bebased on or more of a user identity (ID), a vault ID, a lookup, apredetermination, a security requirement, a data type indicator, a datasize indicator, a data ID, a filename, and dispersal parameters. Forexample, the processing module appends a key 3B to the encrypted datasegment 3 to produce a secure package 3. The method continues with step186 of FIG. 7B where the processing module dispersed storage errorencodes the plurality of secure packages to produce a plurality of setsof encoded data slices and the sends the plurality of sets of encodeddata slices to a dispersed storage network (DSN) memory for storagetherein.

The method continues at step 202 where the processing module, for eachkey of the first plurality of keys, encrypts an appending of the key andanother level key onion utilizing a corresponding key of the secondplurality of keys to produce a corresponding level key onion inaccordance with dispersal parameters. For example, the processing moduleappends a key 2A of the first plurality of keys to a key onion 1 (e.g.,another level key onion) to produce onion content, encrypts the onioncontent utilizing key 2B of the second plurality of keys (e.g., thecorresponding level key) to produce a key onion 2 (e.g., a correspondinglevel key), and sends the key onion 2 to a module affiliated with a nextlevel of a plurality of key onion levels (e.g., based on a next levelentity ID). The method continues at step 204 where the processing moduledispersed storage error encodes a final level key onion of the pluralityof key onion levels to produce one or more sets of encoded onion slicesand outputs the one or more sets of encoded onion slices to the DSNmemory for storage therein.

FIG. 8C is a flowchart illustrating another example of decoding data,which includes similar steps to FIG. 7C. The method begins at step 206where a processing module (e.g., of a dispersed storage processingmodule, of a storage module) dispersed storage error decodes one or moresets of encoded onion slices to reproduce a final level key onion of aplurality of key onion levels. The method continues with step 188 ofFIG. 7C where the processing module dispersed storage error decodes aplurality of sets of encoded data slices to reproduce a plurality ofsecure packages.

The method continues at step 210 where the processing module, for eachsecure package of the plurality of secure packages, splits out acorresponding key of a second plurality of keys and a correspondingencrypted data segment of a plurality of encrypted data segments inaccordance with a splitting approach. For example, the processing modulesplits out a key 2B of the second plurality of keys and encrypted data 2from a secure package 2.

The method continues at step 212 where the processing module, for eachencrypted data segment of the plurality of encrypted data segments,splits out a corresponding key of the first plurality of keys andanother level key onion of a decrypted corresponding level key oniondecrypted utilizing a corresponding key of the second plurality of keys.For example, the processing module decrypts key onion 2 (e.g., decryptedcorresponding level key onion) utilizing key 2B of the second pluralityof keys (e.g., a corresponding key) to produce key onion content andsplits out a key 2A (e.g., the corresponding key of the first pluralityof keys) and key onion 1 (e.g., the another level key onion) from thekey onion content.

The method continues at step 214 where the processing module decryptsthe plurality of encrypted data segments utilizing the first pluralityof keys to produce a plurality of data segments to reproduce data. Forexample, the processing module decrypts encrypted data segment 7utilizing reproduced key 7A to reproduce data segment 7. Next, theprocessing module aggregates the plurality of data segments to reproducethe data.

FIG. 9A is a schematic block diagram of another embodiment of a storagemodule 84. The storage module 84 includes a plurality of encryptors 1-N,a plurality of appenders 1-N, a plurality of information dispersalalgorithm (IDA) encoders 1-N, a plurality of random key generators (RKG)1-N, a plurality of key IDA encoders 1-N, a plurality of IDA decoders1-N, a plurality of splitters 1-N, a plurality of decryptors 1-N, and aplurality of key IDA decoders 1-N, all of which may be implemented asone or more modules. Data for storage in a dispersed storage network(DSN) memory 22 is presented as a plurality of data 1-N (e.g., aplurality of data segments 1-N) to the storage module 84. The storagemodule 84 dispersed storage error encodes each data segment of theplurality of data segments 1-N to produce a plurality of sets 1-N ofencoded data slices for storage in the DSN memory 22. The storage module84 receives the plurality of sets 1-N of encoded data slices from theDSN memory 22 and dispersed storage error decodes each set of theplurality of sets 1-N of encoded data slices to reproduce the pluralityof sets of data segments 1-N to reproduce the data.

RKGs 1-N generate a plurality of keys 1-N based on a key generatingapproach. The encryptors 1-N encrypt data segments 1-N to produce aplurality of encrypted data 1-N utilizing keys 1-N in accordance withdispersal parameters. The plurality of key IDA encoders 1-N dispersedstorage error encode the plurality of keys 1-N in accordance withdispersal parameters to produce a plurality of one or more sets of keyslices. The plurality of one or more sets of key slices includes one ormore sets of key slices 1_1 - 1_n through one or more sets of key slicesN_1 - N_n. For example, key IDA encoder 3 dispersed storage errorencodes key 3 to produce key slices 3_1 - 3_n that includes two sets ofkey slices. For instance, key slices 3_1 includes two slices of a commonpillar 1, key slices 3_2 includes two slices of a common pillar 2,through key slices 3_n that includes two slices of a common pillar n,wherein n represents a key slice pillar width of the dispersalparameters associated with encoding key 3.

The appenders 1-N append the plurality of one or more sets of key slicesto the plurality of encrypted data 1-N to produce a plurality of securepackages 1-N based on an appending approach. The appending includes theone or more of selecting key slices of the plurality of one or more setsof key slices and appending selected key slices to correspondingencrypted data of the plurality of encrypted data 1-N to produce asecure package of the plurality of secure packages 1-N. The appendingapproach may be based on or more of a user identity (ID), a vault ID, alookup, a predetermination, a security requirement, a data typeindicator, a data size indicator, a data ID, a filename, and dispersalparameters. For example, appender 1 appends selected key slices 1_1 -N_1 to encrypted data 1 when a dispersal parameter indicates to appendall key slices of a common pillar 1 of the plurality of one or more setsof key slices for encrypted data 1.

The plurality of IDA encoders 1-N dispersed storage error encode theplurality of secure packages 1-N in accordance with the dispersalparameters to produce the plurality of sets 1-N of encoded data slices.The plurality of sets 1-N of encoded data slices are sent to the DSNmemory 22 for storage therein. The plurality of IDA decoders 1-N receivethe plurality of sets 1-N of encoded data slices from the DSN memory 22and dispersed storage error decode the plurality of sets 1-N of encodeddata slices in accordance with the dispersal parameters to reproduce theplurality of sets of secure packages 1-N.

The splitters 1-N splits the secure packages 1-N into the plurality ofencrypted data 1-N and the plurality of one or more sets of key slicesin accordance with a splitting approach. The splitting approach may bebased on or more of the user identity (ID), the vault ID, a lookup, apredetermination, a security requirement, the data type indicator, thedata size indicator, the data ID, the filename, and the dispersalparameters. For example, splitter 1 splits secure package 1 intoencrypted data 1 and key slices 1_1 - N_1 based on a dispersal parameterthat indicates that key slices 1_1 - N_1 (e.g., of a common pillar 1)were appended to encrypted data 1.

The plurality of key IDA decoders dispersed storage error decodes theplurality of one or more sets of key slices in accordance with dispersalparameters to reproduce the plurality of keys 1-N. For each key IDAdecoder, the decoding includes one or more of selecting correspondingone or more sets of key slices of the plurality one more sets of keyslices and dispersed storage error decoding the corresponding one ormore sets of key slices to reproduce a corresponding key of theplurality of keys 1-N. For example, key IDA decoder N selects key slicesN_1 - N_n as the corresponding one more sets of key slices and dispersedstorage error decodes key slices N_1 - N_n to produce a key N of theplurality of keys 1-N. The plurality of decryptors 1-N decrypt theplurality of encrypted data 1-N utilizing the plurality of reproducedkeys 1-N to reproduce data 1-N to reform the data. For example,decryptor 9 decrypts encrypted data segment 9 utilizing reproduced key 9to reproduce a data segment 9 of a plurality of data segments. Next, theprocessing module aggregates the plurality of data segments to reproducedata.

FIG. 9B is a flowchart illustrating another example of encoding data,which includes similar steps to FIG. 7B. The method begins with step 180of FIG. 7B where a processing module (e.g., of a dispersed storageprocessing module, of a storage module) encrypts a plurality of datasegments of data utilizing a plurality of keys to produce a plurality ofencrypted data segments. The method continues at step 218 where theprocessing module, for each key of the plurality of keys, dispersedstorage error encodes in accordance with dispersal parameters the key toproduce one or more sets of corresponding encoded key slices of aplurality of one or more sets of encoded key slices.

The method continues at step 220 where the processing module, for eachof a key encoding pillar width number of encrypted data segments of theplurality of encrypted data segments, appends at least a key encodingpillar width number of encoded key slices of the plurality of one moresets of encoded key slices to produce a corresponding secure package ofa plurality of secure packages. The appending includes one or more ofselecting encoded key slices of the plurality of one of more sets ofencoded key slices and appending the selected key slices tocorresponding encrypted data segments of the key encoding pillar widthnumber of encrypted data segments to produce the plurality of securepackages. For example, the processing module appends a key slice of eachof the plurality of one or more sets of encoded key slices, wherein eachappended key slice is of a common pillar.

The method continues at step 222 where the processing module, for eachdata segment of remaining encrypted data segments, provides the datasegment to produce a corresponding secure package of the plurality ofsecure packages (e.g., without appending key slices). The methodcontinues with step 186 of FIG. 7B where the processing module dispersedstorage error encodes the plurality of secure packages to produce aplurality of sets of encoded data slices and stores the plurality ofsets of encoded data slices in a dispersed storage network memory.

FIG. 9C is a flowchart illustrating another example of decoding data,which includes similar steps to FIG. 7C. The method begins with step 188of FIG. 7C where a processing module (e.g., of a dispersed storageprocessing module, of a storage module) dispersed storage error decodesa plurality of sets of encoded data slices to reproduce a plurality ofsecure packages. The method continues at step 228 where the processingmodule, for each of a key encoding pillar width number of securepackages of the plurality of secure packages, splits out at least a keyencoding pillar width number of key slices of a plurality of one or moresets of encoded key slices and a corresponding encrypted data segment ofa plurality of encrypted data segments in accordance with a splittingapproach. The splitting approach may be based on or more of a useridentity (ID), a vault ID, a lookup, a predetermination, a securityrequirement, a data type indicator, a data size indicator, a data ID, afilename, and a dispersal parameter.

The method continues at step 230 where the processing module, for eachsecure package of remaining secure packages, provides the secure packageas a corresponding encrypted data segment of the plurality of encrypteddata segments. The method continues at step 232 where the processingmodule, for each encrypted data segment of the plurality of encrypteddata segments, dispersed storage error decodes the one or more sets ofencoded key slices to reproduce a corresponding key of a plurality ofkeys in accordance with a dispersal parameter. The decoding includes oneor more of selecting one or more sets of encoded key slices of theplurality of one or more sets of encoded of key slices to produce one ormore key slice packages of a plurality of key slice packages anddispersed storage error decoding the plurality of key slice packages toreproduce the plurality of keys. The method continues with step 194 ofFIG. 7C where the processing module decrypts the plurality of encrypteddata segments utilizing the plurality of keys to reproduce a pluralityof data segments to reproduce the data. For example, the processingmodule decrypts encrypted data segment 10 utilizing reproduced key 10 toreproduce data segment 10. Next, the processing module aggregates theplurality of data segments to reproduce the data.

FIG. 10 is a schematic block diagram of a computing device 234 of thedispersed storage network (DSN). Computing device 234 includes encryptor236, appender 238, information dispersal algorithm (IDA) encoder 240,key IDA encoder 242, and appender select 244, all of which may beimplemented as one or more modules. Computing device 234 includes astorage module that includes a distributed/dispersed storage (DS)module. Encryptor 236 may include more than one encryptor (e.g., Xnumber of encryptors for X data segments). Appender 238 may include morethan one appender (e.g., X number of appenders for X data segments). IDAencoder 240 may include more than one IDA encoder (e.g., X number of IDAencoders for X data segments).

In an example of operation, computing device 234 receives a data objectfor secure storage in a set of storage units of the DSN. Computingdevice 234 segments the data object in X number of data segments. Randomkey generators (RKGs) 1-X generate keys 1-X based on a key generatingapproach and may retrieve keys 1-X from a local memory of one or morelocal memories associated with the encoding of each data segment of datasegments 1-X. The key generating approach may be based on one or more ofa key seed, a pseudorandom sequence, a random number generator, apredetermined list, a lookup, a private key retrieval, and public-keyretrieval, a public/private key pair generation, and a key generationalgorithm.

Encryptor 236 encrypts data segments 1-X with keys 1-X to produceencrypted data segments 1-X. For example, data segment 1 is encryptedwith key 1 to produce encrypted data segment 1, data segment 2 isencrypted with key 2 to produce encrypted data segment 2, data segment 3is encrypted with key 3 to produce encrypted data segment 3, etc. Thekey IDA encoder 242 dispersed storage error encodes keys 1-X using a keydispersed storage error encoding function in accordance with dispersalparameters to produce a set of encoded key slices 1-Wk. Key IDA encoder242 dispersal parameters include the pillar width number (Wk) (i.e., howmany encoded key slices are in the set of encoded key slices), a decodethreshold number (i.e., how many encoded key slices are needed torecover keys 1-X), and an error encoding function (e.g., Reed-Solomon orother forward error correction (FEC) scheme, information dispersalalgorithm, other error correction coding, etc.).

Appender select 244 selects at least a decode threshold number ofencoded key slices to append to at least some of the encrypted datasegments in accordance with an appending approach. The appendingapproach may include selecting encoded key slices and an encrypted datasegment for appending at random, based on a pseudo-random approach, orany function such that no one encrypted data segment includes at theleast the decode threshold number of encoded key slices. The appendingapproach may be included as a dispersal parameter set in the key IDAencoder 242. Appender select 244 selects the encoded key slices forappending and instructs appender 238 on how to append the encoded keyslices to the encrypted data segments 1-X. Appender 238 appends at leasta decode threshold number of encoded key slices to at least some of theencrypted data segments to produce secure packages 1-X.

IDA encoder 240 dispersed storage error encodes secure packages 1-Xusing a dispersed storage error encoding function to produce sets ofencoded data slices (EDS sets 1-X). For example, a first secure packageof secure packages 1-X is dispersed storage error encoded using thedispersed storage error encoding function to produce EDS set 1 of thesets of encoded data slices 1-X. The dispersed storage error encodingfunction includes dispersal parameters (i.e., pillar width number, adecode threshold number, and an error encoding function (e.g.,Reed-Solomon or other forward error correction (FEC) scheme, informationdispersal algorithm, other error correction coding, etc.)) that candiffer from the dispersal parameters of the key dispersed storage errorencoding function. Computing device 234 sends the sets of encoded dataslices to the set of storage devices of the DSN for storage therein.

FIGS. 11A-11B are schematic block diagrams of examples of securepackages. FIG. 11A depicts secure packages 246. Secure packages 246include encrypted data segments 1-5 (i.e., the data object has beensegmented into data segments 1-5 and each data segment has beenencrypted by a corresponding key 1-5) where encrypted data segment 1 isappended with key slice 1, encrypted data segment 3 is appended with keyslice 2, and encrypted data segment 5 is appended with key slice 3. Keys1-5 have been dispersed storage error encoded using a key dispersedstorage error encoding function to produce a set of encoded key slices(key slices 1-5). In this example, the key dispersed storage errorencoding function includes a pillar width number of 5 and a decodethreshold number of 3. As such, only 3 key slices need to be appended toat least some of the encrypted data segments in order to recover keys1-5. Here, an appending approach specified appending the decodethreshold number (3) of encoded key slices such that every otherencrypted data segment is appended with an encoded key slice of encodedkey slices 1-3.

FIG. 11B depicts secure packages 248. Secure packages 248 includeencrypted data segments 1-5 (i.e., the data object has been segmentedinto data segments 1-5 and each data segment has been encrypted by acorresponding key 1-5) where encrypted data segment 1 is appended withkey slices 1 and 3, encrypted data segment 3 is appended with key slice4, encrypted data segment 4 is appended with key slice 5, and encrypteddata segment 5 is appended with key slice 2. Keys 1-5 have beendispersed storage error encoded using a key dispersed storage errorencoding function to produce a set of encoded key slices (encoded keyslices 1-8). In this example, the key dispersed storage error encodingfunction includes a pillar width number of 8 and a decode thresholdnumber of 5. As such, only 5 key slices need to be appended to at leastsome of the encrypted data segments in order to recover keys 1-5. Here,an appending approach specified appending the decode threshold number(5) of encoded key slices in a random sequence while ensuring that noone encrypted data segment is appended with the decode threshold number(5) of encoded key slices.

FIG. 12 is a schematic block diagram of computing device 234 of thedispersed storage network (DSN). Computing device 234 includesinformation dispersal algorithm (IDA) decoder 250, key IDA decoder 256,splitter 252, and decryptor 254, all of which may be implemented as oneor more modules. Decryptor 254 may include more than one decryptor(e.g., X number of decryptors for X data segments). Splitter 252 mayinclude more than one splitter (e.g., X number of splitters for X datasegments). IDA decoder 250 may include more than one IDA decoder (e.g.,X number of IDA decoders for X data segments).

In an example of operation, computing device 234 retrieves the sets ofencoded data slices (EDS sets 1-X) from the set of storage devices ofthe DSN. IDA decoder 250 dispersed storage error decodes the sets ofencoded data slices using a dispersed storage error decoding functionhaving the same dispersal parameters as the dispersed storage errorencoding function to produce secure packages 1-X. Splitter 252 splitsthe at least the decode threshold number of encoded key slices of theset of encoded key slices from the secure packages 1-X to produceencrypted data segments 1-X. For example, key slice 1 of the at leastthe decode threshold number of encoded key slices is split from securepackage 1 of secure packages 1-X to produce encrypted data segment 1 ofencrypted data segments 1-X.

Key IDA decoder 256 dispersed storage error decodes the at least thedecode threshold number of encoded key slices using a key dispersedstorage error decoding function having the same dispersal parameters asthe key dispersed storage error encoding function to produce encryptionkeys 1-X. Decryptor 254 decrypts encrypted data segments 1-X usingencryption keys 1-X to produce data segments 1-X. For example, key 1 isused to decrypt encrypted data segment 1 to produce data segment 1. Thecomputing device 234 de-segments data segments 1-X to produce the dataobject.

FIG. 13 is a schematic block diagram of computing device 234 of thedispersed storage network (DSN). Computing device 234 includes encryptor236, appender 238, information dispersal algorithm (IDA) encoder 240,key IDA encoder 242, and appender select 244, all of which may beimplemented as one or more modules. Computing device 234 includes astorage module that includes a distributed/dispersed storage (DS)module. Encryptor 236 may include more than one encryptor (e.g., Xnumber of encryptors for X data segments). Appender 238 may include morethan one appender (e.g., X number of appenders for X data segments). IDAencoder 240 may include more than one IDA encoder (e.g., X number of IDAencoders for X data segments). Key IDA encoder 242 may include more thanone key IDA encoder (e.g., X number of key IDA encoder for X keys).

In an example of operation, computing device 234 operates similarly toFIG. 10 however each key 1-X is dispersed storage error encoded using akey dispersed storage error encoding function in accordance withdispersal parameters to produce sets of encoded key slices (key slices1_1-Wk_1, key slices 1_2-Wk_2, key slices 1_3-Wk_3 through key slices1_Wk-Wk_X). Key IDA encoder 242 dispersal parameters include the pillarwidth number Wk (i.e., how many encoded key slices are in each set ofencoded key slices), a decode threshold number (i.e., how many encodedkey slices of each set are needed to recover each key 1-X), and an errorencoding function (e.g., Reed-Solomon or other forward error correction(FEC) scheme, information dispersal algorithm, other error correctioncoding, etc.).

Appender select 244 selects at least a decode threshold number ofencoded key slices of each set of encoded key slices to append to atleast some of the encrypted data segments in accordance with anappending approach. The appending approach may include selecting encodedkey slices and an encrypted data segment for appending at random, basedon a pseudo-random approach, or any function such that no one encrypteddata segment of the at least some of the encrypted data segmentsincludes the at least the decode threshold number of encoded key slicesof a set of encoded key slices of the sets of encoded key slices. Theappending approach may be included as a dispersal parameter in the keyIDA encoder 242. Appender select 244 selects the encoded key slices forappending and instructs appender 238 on how to append the encoded keyslices to the encrypted data segments 1-X. Appender 238 appends at leasta decode threshold number of encoded key slices of each of the sets ofencoded key slices to at least some of the encrypted data segments toproduce secure packages 1-X.

FIG. 14 is a schematic block diagram of an example of secure packages258. Secure packages 258 include encrypted data segments 1-5 (i.e., thedata object has been segmented into data segments 1-5 and each datasegment has been encrypted by a corresponding key 1-5) that are appendedwith encoded key slices of sets of encoded key slices 257 in accordancewith an appending approach.

In this example, each key 1-5 is dispersed storage error encoded using akey dispersed storage error encoding function with a pillar number of 5and a decode threshold number of 3. As such, at least 3 encoded keyslices from each set of encoded key slices need to be appended to atleast some of the encrypted data segments in order to recover keys 1-5.Here, an appending approach specified appending at least the decodethreshold number (3) of encoded key slices from each set of encoded keyslices in a random sequence while ensuring that no one encrypted datasegment is appended with at least the decode threshold number (3) ofencoded key slices from a set of encoded key slices.

For example, key slices 1_1 and 2_1 from the first set of encoded keyslices and key slice 1_2 from the second set of encoded key slices areappended to encrypted data segment 1, key slice 3_1 from the first setof encoded key slices and key slice 2_3 from the third set of encodedkey slices are appended to encrypted data segment 2, key slices 2_2 and3_2 from the second set of encoded key slices and key slices 4_3 and 5_3from the third set of encoded key slices are appended to encrypted datasegment 3, key slice 3_4 from the fourth set of encoded key slices andkey slices 1_5 and 2_5 from the fifth set of encoded key slices areappended to encrypted data segment 4, and key slice 3_5 from the fifthset of encoded key slices and key slices 2_4 and 5_4 from the fourth setof encoded key slices are appended to encrypted data segment 5.

FIG. 15 is a logic flowchart illustrating an example of securely storingrandom keys. The method begins with step 260 where a computing device ofa dispersed storage network (DSN) segments a data object into datasegments. Random key generators (RKGs) generate encryption keys based ona key generating approach and may retrieve encryption keys from a localmemory of one or more local memories associated with the encoding ofeach data segment of the data segments. The key generating approach maybe based on one or more of a key seed, a pseudorandom sequence, a randomnumber generator, a predetermined list, a lookup, a private keyretrieval, and public-key retrieval, a public/private key pairgeneration, and a key generation algorithm.

The method continues with step 262 where the computing device encryptsthe data segments using the encryption keys to produce encrypted datasegments. For example, a first encryption key of the encryption keys isused to encrypt a first data segment of the data segments to produce afirst encrypted data segment of the encrypted data segments.

The method continues with step 264 where the computing device dispersedstorage error encodes the encryption keys using a key dispersed storageerror encoding function to produce a set of encoded key slices.Dispersal parameters of the key dispersed storage error encodingfunction include the pillar width number Wk (i.e., how many encoded keyslices are in the set of encoded key slices), a decode threshold number(i.e., how many encoded key slices are needed to recover keys 1-X), andan error encoding function (e.g., Reed-Solomon or other forward errorcorrection (FEC) scheme, information dispersal algorithm, other errorcorrection coding, etc.).

The method continues with step 266 where the computing device appends atleast a decode threshold number of encoded key slices of the set ofencoded key slices to at least some of the encrypted data segments inaccordance with an appending approach to produce secure packages. Forexample, a first encoded key slice of the at least the decode thresholdnumber of encoded key slices is appended to the first encrypted datasegment to produce a first secure package of the secure packages. Theappending approach may include selecting encoded key slices and anencrypted data segment for appending at random, based on a pseudo-randomapproach, or any function such that no one encrypted data segment isappended with the at the least the decode threshold number of encodedkey slices. The appending approach may be included as a dispersalparameter in the key dispersed storage error encoding function.

Alternatively, each encryption key of the encryption keys is dispersedstorage error encoded using a key dispersed storage error encodingfunction in accordance with dispersal parameters to produce sets ofencoded key slices. The computing device appends at least a decodethreshold number of encoded key slices of each of the sets of encodedkey slices to at least some of the encrypted data segments in accordancewith a second appending approach to produce the secure packages. Thesecond appending approach may include selecting encoded key slices andan encrypted data segment for appending at random, based on apseudo-random approach, or any function such that no one encrypted datasegment of the at least some of the encrypted data segments includes theat least the decode threshold number of encoded key slices of a set ofencoded key slices of the sets of encoded key slices.

The method continues with step 268 where the computing device dispersedstorage error encodes the secure packages to produce sets of encodeddata slices. For example, the first secure package is dispersed storageerror encoded using the dispersed storage error encoding function toproduce a first set of encoded data slices of the sets of encoded dataslices and a second secure package of the secure packages is dispersedstorage error encoded using the dispersed storage error encodingfunction to produce a second set of encoded data slices of the sets ofencoded data slices. The dispersed storage error encoding functionincludes dispersal parameters (i.e., pillar width number, a decodethreshold number, and an error encoding function (e.g., Reed-Solomon orother forward error correction (FEC) scheme, information dispersalalgorithm, other error correction coding, etc.)) that can differ fromthe dispersal parameters of the key dispersed storage error encodingfunction. The computing device sends the sets of encoded data slices toa set of storage devices of the DSN for storage therein.

It is noted that terminologies as may be used herein such as bit stream,stream, signal sequence, etc. (or their equivalents) have been usedinterchangeably to describe digital information whose contentcorresponds to any of a number of desired types (e.g., data, video,speech, text, graphics, audio, etc. any of which may generally bereferred to as ‘data’).

As may be used herein, the terms “substantially” and “approximately”provides an industry-accepted tolerance for its corresponding termand/or relativity between items. For some industries, anindustry-accepted tolerance is less than one percent and, for otherindustries, the industry-accepted tolerance is 10 percent or more. Otherexamples of industry-accepted tolerance range from less than one percentto fifty percent. Industry-accepted tolerances correspond to, but arenot limited to, component values, integrated circuit process variations,temperature variations, rise and fall times, thermal noise, dimensions,signaling errors, dropped packets, temperatures, pressures, materialcompositions, and/or performance metrics. Within an industry, tolerancevariances of accepted tolerances may be more or less than a percentagelevel (e.g., dimension tolerance of less than +/- 1%). Some relativitybetween items may range from a difference of less than a percentagelevel to a few percent. Other relativity between items may range from adifference of a few percent to magnitude of differences.

As may also be used herein, the term(s) “configured to”, “operablycoupled to”, “coupled to”, and/or “coupling” includes direct couplingbetween items and/or indirect coupling between items via an interveningitem (e.g., an item includes, but is not limited to, a component, anelement, a circuit, and/or a module) where, for an example of indirectcoupling, the intervening item does not modify the information of asignal but may adjust its current level, voltage level, and/or powerlevel. As may further be used herein, inferred coupling (i.e., where oneelement is coupled to another element by inference) includes direct andindirect coupling between two items in the same manner as “coupled to”.

As may even further be used herein, the term “configured to”, “operableto”, “coupled to”, or “operably coupled to” indicates that an itemincludes one or more of power connections, input(s), output(s), etc., toperform, when activated, one or more its corresponding functions and mayfurther include inferred coupling to one or more other items. As maystill further be used herein, the term “associated with”, includesdirect and/or indirect coupling of separate items and/or one item beingembedded within another item.

As may be used herein, the term “compares favorably”, indicates that acomparison between two or more items, signals, etc., provides a desiredrelationship. For example, when the desired relationship is that signal1 has a greater magnitude than signal 2, a favorable comparison may beachieved when the magnitude of signal 1 is greater than that of signal 2or when the magnitude of signal 2 is less than that of signal 1. As maybe used herein, the term “compares unfavorably”, indicates that acomparison between two or more items, signals, etc., fails to providethe desired relationship.

As may be used herein, one or more claims may include, in a specificform of this generic form, the phrase “at least one of a, b, and c” orof this generic form “at least one of a, b, or c”, with more or lesselements than “a”, “b”, and “c”. In either phrasing, the phrases are tobe interpreted identically. In particular, “at least one of a, b, and c”is equivalent to “at least one of a, b, or c” and shall mean a, b,and/or c. As an example, it means: “a” only, “b” only, “c” only, “a” and“b”, “a” and “c”, “b” and “c”, and/or “a”, “b”, and “c”.

As may also be used herein, the terms “processing module”, “processingcircuit”, “processor”, “processing circuitry”, and/or “processing unit”may be a single processing device or a plurality of processing devices.Such a processing device may be a microprocessor, microcontroller,digital signal processor, microcomputer, central processing unit, fieldprogrammable gate array, programmable logic device, state machine, logiccircuitry, analog circuitry, digital circuitry, and/or any device thatmanipulates signals (analog and/or digital) based on hard coding of thecircuitry and/or operational instructions. The processing module,module, processing circuit, processing circuitry, and/or processing unitmay be, or further include, memory and/or an integrated memory element,which may be a single memory device, a plurality of memory devices,and/or embedded circuitry of another processing module, module,processing circuit, processing circuitry, and/or processing unit. Such amemory device may be a read-only memory, random access memory, volatilememory, non-volatile memory, static memory, dynamic memory, flashmemory, cache memory, and/or any device that stores digital information.Note that if the processing module, module, processing circuit,processing circuitry, and/or processing unit includes more than oneprocessing device, the processing devices may be centrally located(e.g., directly coupled together via a wired and/or wireless busstructure) or may be distributedly located (e.g., cloud computing viaindirect coupling via a local area network and/or a wide area network).Further note that if the processing module, module, processing circuit,processing circuitry and/or processing unit implements one or more ofits functions via a state machine, analog circuitry, digital circuitry,and/or logic circuitry, the memory and/or memory element storing thecorresponding operational instructions may be embedded within, orexternal to, the circuitry comprising the state machine, analogcircuitry, digital circuitry, and/or logic circuitry. Still further notethat, the memory element may store, and the processing module, module,processing circuit, processing circuitry and/or processing unitexecutes, hard coded and/or operational instructions corresponding to atleast some of the steps and/or functions illustrated in one or more ofthe Figures. Such a memory device or memory element can be included inan article of manufacture.

One or more embodiments have been described above with the aid of methodsteps illustrating the performance of specified functions andrelationships thereof. The boundaries and sequence of these functionalbuilding blocks and method steps have been arbitrarily defined hereinfor convenience of description. Alternate boundaries and sequences canbe defined so long as the specified functions and relationships areappropriately performed. Any such alternate boundaries or sequences arethus within the scope and spirit of the claims. Further, the boundariesof these functional building blocks have been arbitrarily defined forconvenience of description. Alternate boundaries could be defined aslong as the certain significant functions are appropriately performed.Similarly, flow diagram blocks may also have been arbitrarily definedherein to illustrate certain significant functionality.

To the extent used, the flow diagram block boundaries and sequence couldhave been defined otherwise and still perform the certain significantfunctionality. Such alternate definitions of both functional buildingblocks and flow diagram blocks and sequences are thus within the scopeand spirit of the claims. One of average skill in the art will alsorecognize that the functional building blocks, and other illustrativeblocks, modules and components herein, can be implemented as illustratedor by discrete components, application specific integrated circuits,processors executing appropriate software and the like or anycombination thereof.

In addition, a flow diagram may include a “start” and/or “continue”indication. The “start” and “continue” indications reflect that thesteps presented can optionally be incorporated in or otherwise used inconjunction with one or more other routines. In addition, a flow diagrammay include an “end” and/or “continue” indication. The “end” and/or“continue” indications reflect that the steps presented can end asdescribed and shown or optionally be incorporated in or otherwise usedin conjunction with one or more other routines. In this context, “start”indicates the beginning of the first step presented and may be precededby other activities not specifically shown. Further, the “continue”indication reflects that the steps presented may be performed multipletimes and/or may be succeeded by other activities not specificallyshown. Further, while a flow diagram indicates a particular ordering ofsteps, other orderings are likewise possible provided that theprinciples of causality are maintained.

The one or more embodiments are used herein to illustrate one or moreaspects, one or more features, one or more concepts, and/or one or moreexamples. A physical embodiment of an apparatus, an article ofmanufacture, a machine, and/or of a process may include one or more ofthe aspects, features, concepts, examples, etc. described with referenceto one or more of the embodiments discussed herein. Further, from figureto figure, the embodiments may incorporate the same or similarly namedfunctions, steps, modules, etc. that may use the same or differentreference numbers and, as such, the functions, steps, modules, etc. maybe the same or similar functions, steps, modules, etc. or differentones.

Unless specifically stated to the contra, signals to, from, and/orbetween elements in a figure of any of the figures presented herein maybe analog or digital, continuous time or discrete time, and single-endedor differential. For instance, if a signal path is shown as asingle-ended path, it also represents a differential signal path.Similarly, if a signal path is shown as a differential path, it alsorepresents a single-ended signal path. While one or more particulararchitectures are described herein, other architectures can likewise beimplemented that use one or more data buses not expressly shown, directconnectivity between elements, and/or indirect coupling between otherelements as recognized by one of average skill in the art.

The term “module” is used in the description of one or more of theembodiments. A module implements one or more functions via a device suchas a processor or other processing device or other hardware that mayinclude or operate in association with a memory that stores operationalinstructions. A module may operate independently and/or in conjunctionwith software and/or firmware. As also used herein, a module may containone or more sub-modules, each of which may be one or more modules.

As may further be used herein, a computer readable memory includes oneor more memory elements. A memory element may be a separate memorydevice, multiple memory devices, or a set of memory locations within amemory device. Such a memory device may be a read-only memory, randomaccess memory, volatile memory, non-volatile memory, static memory,dynamic memory, flash memory, cache memory, and/or any device thatstores digital information. The memory device may be in a form asolid-state memory, a hard drive memory, cloud memory, thumb drive,server memory, computing device memory, and/or other physical medium forstoring digital information.

While particular combinations of various functions and features of theone or more embodiments have been expressly described herein, othercombinations of these features and functions are likewise possible. Thepresent disclosure is not limited by the particular examples disclosedherein and expressly incorporates these other combinations.

What is claimed is:
 1. A method for execution by one or more computingdevices of a storage network comprises: appending at least a decodethreshold number of encoded key slices of a set of encoded key slices toat least some encrypted data segments of a plurality of encrypted datasegments to produce secure packages; error encoding, in accordance witherror encoding parameters, the secure packages to produce sets ofencoded data slices, wherein a first secure package of the securepackages is dispersed storage error encoded using an error encodingfunction of the error encoding parameters to produce a first set ofencoded data slices of the sets of encoded data slices; and outputtingthe sets of encoded data slices for storage in memory of the storagenetwork.
 2. The method of claim 1 further comprises: error encoding anencryption key to produce the set of encoded key slices.
 3. The methodof claim 2, wherein the error encoding the encryption key is performedin accordance with the error encoding parameters.
 4. The method of claim2, wherein the error encoding the encryption key is performed inaccordance with second error encoding parameters.
 5. The method of claim4, wherein the error encoding parameters comprises: a first pillarwidth; and a first decode threshold.
 6. The method of claim 5, whereinthe second error encoding parameters comprises: a second pillar width;and a second decode threshold.
 7. The method of claim 1, wherein theappending the at least a decode threshold number of encoded key slicesof the set of encoded key slices to the at least some encrypted datasegments is based on an appending approach.
 8. The method of claim 7,wherein the appending approach is a random sequence.
 9. The method ofclaim 7, wherein the appending approach is a pseudo random sequence. 10.The method of claim 7, wherein the appending approach is a function. 11.The method of claim 7, wherein the appending approach comprisesappending rules such that no individual encrypted data segment of the atleast some of the encrypted data segments includes the at least thedecode threshold number of encoded key slices of a set of encoded keyslices of the sets of encoded key slices.
 12. A computing device of astorage network, the computing device comprises: memory; an interface;and a processing module operably coupled to the memory and theinterface, wherein the processing module is operable to: append at leasta decode threshold number of encoded key slices of a set of encoded keyslices to at least some encrypted data segments of a plurality ofencrypted data segments to produce secure packages; error encode, inaccordance with error encoding parameters, the secure packages toproduce sets of encoded data slices, wherein a first secure package ofthe secure packages is dispersed storage error encoded using an errorencoding function of the error encoding parameters to produce a firstset of encoded data slices of the sets of encoded data slices; andoutput, via the interface, the sets of encoded data slices for storagein memory of the storage network.
 13. The computing device of claim 12,wherein the processing module is further operable to: error encoding anencryption key to produce the set of encoded key slices.
 14. Thecomputing device of claim 13, wherein the error encoding the encryptionkey is performed in accordance with the error encoding parameters. 15.The computing device of claim 13, wherein the error encoding theencryption key is performed in accordance with second error encodingparameters.
 16. The computing device of claim 15, wherein the errorencoding parameters comprise: a first pillar width; and a first decodethreshold.
 17. The computing device of claim 16, wherein the seconderror encoding parameters comprise: a second pillar width; and a seconddecode threshold.
 18. The computing device of claim 12, wherein theappending the at least a decode threshold number of encoded key slicesof the set of encoded key slices to the at least some encrypted datasegments is based on an appending approach.
 19. The computing device ofclaim 12, wherein the appending approach is a function.
 20. Thecomputing device of claim 12, wherein the appending approach comprisesappending rules such that no individual encrypted data segment of the atleast some of the encrypted data segments includes the at least thedecode threshold number of encoded key slices of a set of encoded keyslices of the sets of encoded key slices.